Given is a permutation P_1, \ldots, P_N of 1, \ldots, N. Find the number of integers i (1 \leq i \leq N) that satisfy the following condition:

* For any integer j (1 \leq j \leq i), P_i \leq P_j.

Constraints

* 1 \leq N \leq 2 \times 10^5
* P_1, \ldots, P_N is a permutation of 1, \ldots, N.
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
P_1 ... P_N


Output

Print the number of integers i that satisfy the condition.

Examples

Input

5
4 2 5 1 3


Output

3


Input

4
4 3 2 1


Output

4


Input

6
1 2 3 4 5 6


Output

1


Input

8
5 7 4 2 6 8 1 3


Output

4


Input

1
1


Output

1
import java.util.*;

class Main {
	Scanner sc;
	int N;
	int[] P;
	
	private void calc() {
		sc = new Scanner(System.in);
		int N = sc.nextInt();
		P = new int[N];
		for (int i = 0; i < N; i++) P[i] = sc.nextInt();

		int c = 0;
		int min = Integer.MAX_VALUE;
		for (int i = 0; i < N; i++) {
			if (min > P[i]) c++;
			min = Math.min(min, P[i]);
		}

		System.out.println(c);
	}

	public static void main(String[] args) {
		new Main().calc();
	}
}
