import java.util.*;

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

        solve_152_C();

        return;
    }

    private static void solve_152_C() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int P[] = new int[N];
        int count = 0;
        Boolean judge = false;

        for(int i=0; i<N; i++){
            P[i] = sc.nextInt();
        }
        int max = P[0];

        for(int i=0; i<N; i++) {
            int value = P[i];
            if(value <= max) count++;
            max = Math.min(max,value);
        }
        System.out.println(count);
    }
}
/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