#define _CRT_SECURE_NO_DEPRECATE
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <ctime>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <math.h>
#include <stack>
#include <deque>
#include <numeric>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <bitset>

#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ld epsylon = 1e-9;
typedef unsigned int ui;
inline long double get_time(){   
	return (long double)clock()/CLOCKS_PER_SEC;
};
ld start_time,end_time;

int arr1[100001], arr2[100001];

int main()
{
	freopen("seq.in","r",stdin);
	freopen("seq.out","w",stdout);
	//start_time = get_time();
	//program
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin>>arr1[i];arr2[i]=arr1[i];
	}
	sort(arr2,arr2+n);
	int res = 0;
	for (int i = 0, j = 0; i < n; ++i) {
		while (arr1[j]!=arr2[i]) {
			j++;res++;
			if (j>=n) break;
		}
		if (arr1[j]==arr2[i]) j++;
		if (j>=n) break;
	}
	cout<<res;
	//end program
	//end_time=get_time()-start_time;
	return 0;
}