#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

int main()
{
	int N;
	cin >> N;
	ll a[100010];

	for (int i = 0; i < N; i++) {
		cin >> a[i];
	}

	int pre = a[0],cnt = 1;
	for (int i = 1; i < N; i++) {
		if (a[0] < a[i]) {
			cnt++;
			pre = a[i];
		}
	}
	cout << N-cnt<< endl;
	return 0;
}