/*
TASK:psort
LANG:C++
*/

#include <stdio.h>
//#include <conio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
using namespace std;

#define pr printf
#define MN  50010

int a[MN],ind[MN];
long long f[MN];
int n;

int main()
{
	//freopen("p6.in","r",stdin);
	scanf("%d",&n);
	for (int i=1;i<=n;++i) scanf("%d",a+i);
	
	for (int i=1;i<=n;++i) ind[a[i]]=i;
	int maxind=ind[1];
	f[1]=0;
	for (int i=2;i<=n;++i) {
		if (maxind<ind[i]) {
            maxind=ind[i];
            f[i]=f[i-1];
		}
		else f[i]=f[i-1]+1;
	}
	//pr("%d\n",f[n]);
	cout<<f[n]<<endl;

	//getch();
	return 0;
}
