
import java.util.Scanner;
//
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
		int n=sc.nextInt();
		int[] permutations =new int[n+1]; //Piを入れる配列
		int min=n ;
		int[] mins =new int[n+1];//P1~Piの最小値を保存する配列
		for (int i=1;i<=n;i++) {
			permutations[i] = sc.nextInt();
			if (i==1) {
				min=permutations[1];
			}
			min = Math.min(min,permutations[i]);
			mins[i] =min;
		}
		int ans =0;
		for (int i=1;i<=n;i++) {
			if(permutations[i]==mins[i]) {
				ans ++;
			}
		}
		System.out.println(ans);
		
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
	}
	//----------------------------------------
	//メソッド置き場

	//----------------------------------------
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz