#include <stdio.h>
#include <algorithm>

using namespace std;

FILE *f,*s;

int n,c,i,j,z,l,m,v1[5005],v2[5005];

int main()
{
	f=fopen("secv.in","r");
	s=fopen("secv.out","w");
	
	fscanf(f,"%d\n",&n);
	
	for(i=1;i<=n;i++)
	{
		fscanf(f,"%d ",&v1[i]);
		
		v2[i]=v1[i];
	}	
	
	
	sort(v2+1,v2+n+1);
	
	c=n;
	for(i=n;i>1;i--)
	{
		if(v2[i]==v2[i-1])
		{	
			v2[i]=2000000001;
			c--;
		}	
	}	
	
	sort(v2+1,v2+n+1);
	
	m=5000;
	for(i=1;i<=n-c+1;i++)
	{
		l=0;
		z=1;
		for(j=i;j<=n;j++)
		{
			if(v1[j]==v2[z])
				z++;
			
			l++;
			
			if(z==c+1)
				break;
		}

		if(l<m&&z==c+1)
			m=l;
	}	
	
	fprintf(s,"%d\n",m);
	
	fclose(s);
	
	return 0;
}