For this Question: Given an array A containing a permutation of N numbers. Find the number of indices i such that <b>A[i] <= A[j] satisfies for all the values of j satisfying 1 <= j <= i </b>.The first line of the input contains an input N, the size of the permutation.
The second line of the input contains N singly spaced integers, the elements of the permutation P.

<b>Constraints</b>
1 <= N <= 200000
1 <= P[i] <= N
P is a permutation of the first N natural numbers.Output a single integer, the answer to the problem.Sample Input
6
3 2 5 6 1 4

Sample Output
3

Sample Input
3
1 2 3

Sample Output
1

<b>Explanation 1:</b> 
The indices i=1, i=2, and i=5 satisfy the condition., I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws Exception {

        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt(reader.readLine());

        int min = N + 1;
        StringTokenizer tokens = new StringTokenizer(reader.readLine());
        int c = 0;
        for(int i = 0; i < N; i++) {
            int x = Integer.parseInt(tokens.nextToken());
            if(x < min) {

                c++;
                min = x;
            }
        }

        System.out.println(c);

        reader.close();
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?