#include<iostream>
#include<algorithm>
using namespace std;
using lint=int64_t;

int main()
{
	int N;
	int a[100010]={};

	cin >> N;
	for(int i=1;i<=N;i++)
		cin >> a[i];

	int dp[100010]={};
	int Max=0;
	for(int i=1;i<=N;i++)
	{
		dp[i]=dp[i-1];
		if(a[i]<Max)
			dp[i]++;
		Max=max(Max,a[i]);
	}

	cout << dp[N] << endl;
	return 0;
}