#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#define rep( i, n, m ) for(ll i = ( n ); i < ( m ); i++)
using ll = long long int;

int give_water( int* array, int begin, int end );

int main( void ){
	int n;
	if (!scanf( "%d", &n ))
		return 0;
	int count = 0;
	rep( i, 0, n ){
		static int max_input = 0;
		int input;
		if (!scanf( "%d", &input ))
			return 0;
		if (input < max_input)
			count++;
		if (max_input < input)
			max_input = input;
	}
	printf( "%d\n", count);
	return 0;
}