#include<cstdio>
#include<algorithm>
using namespace std;
int mini=2000000009;
int n,nr;
int pm[5003];
int v[5003];
int s[5003];

void read()
{
	freopen("secv.in","r",stdin);
	freopen("secv.out","w",stdout);
	scanf("%d",&n);
	int i;
	for(i=1;i<=n;i++)
	{
		scanf("%d",&v[i]);
		if(v[i]<mini)
		{
			mini=v[i];
			pm[1]=i;
			pm[0]=1;
		}
		else
			if(v[i]==mini)
				pm[++pm[0]]=i;
		s[i]=v[i];
	}
}

void make()
{
	int i;
	s[++nr]=s[1];
	for(i=2;i<=n;i++)
		if(s[i]!=s[i-1])
			s[++nr]=s[i];
}

void rez()
{
	int i,j,k,poz,max=2000000009;
	for(k=1;k<=pm[0];k++)
	{
		poz=pm[k];
		j=poz+1;
		for(i=2;i<=nr && j<=n;i++)
			for(j=poz+1;j<=n;j++)
				if(v[j]==s[i])
				{
					poz=j;
					break;
				}
		if(i==nr+1)
			if((j-pm[k]+1)<max)
				max=j-pm[k]+1;
	}
	printf("%d\n",max);
}

int main()
{
	read();
	sort(s+1,s+n+1);
	make();
	rez();
	return 0;
}