#include <stdio.h>
#include <algorithm>
#define N 6009
using namespace std;
int v1[N],v[N],c[N],ss[N];
int nr,n,rez=N+1;
void scan()
{
	freopen("secv.in", "r",stdin);
	freopen("secv.out", "w",stdout);
	scanf("%d", &n);
	for(int i=1;i<=n;++i)
	{
		scanf("%d", &v[i]);
		v1[i]=v[i];
	}    
}	
void solve()
{
	sort(v1+1,v1+n+1);
	int j=0;
	for(int i=1;i<=n;++i)
		if(v1[i]!=v1[i-1])
			c[++j]=v1[i];
	
	/*for(int i=1;i<=j;++i)
		printf("%d ", c[i]);*/
	nr=j;
	for(int i=1;i<=n;++i)
	{
		int k=1;
		if(v[i]==c[k++])
			for(int j=i+1;j<=n;++j)
				if(v[j]==c[k])
				{
					++k;
					if(k>nr)
						if(j-i+1<rez)
							rez=j-i+1;
				}
	}
	printf("%d\n", rez);
}
int main()
{
	scan();
	solve();
	return 0;
}