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

#include <cstdio>
using namespace std;

const int MAXN = 50005;

int n;
int a[MAXN];
int lns[MAXN];

int main()
{
//	freopen("psort.in","r",stdin);
//	freopen("psort.out","w",stdout);
	
	scanf("%d",&n);
	for ( int i = 1 ; i <= n ; i++ )
		scanf("%d",&a[i]);
		
	lns[1] = a[1];
	int k = 1;
	for ( int i = 2 ; i <= n ; i++ )
	{
		if ( a[i] < lns[1] ) lns[1] = a[i];
		else if ( a[i] > lns[k] ) lns[++k] = a[i];
		else
		{
			int l=1, r=k;
			while ( l < r-1 )
			{
				int m = (l+r)/2;
				if ( a[i] > lns[m] ) l = m;
				else r = m;
			}
			lns[r] = a[i];
		}
	}
	printf("%d\n",n-k);
}
