#include <fstream>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream cin("secv.in");
ofstream cout("secv.out");
  
int c[5005], r[5005], a[5005],  i, j,  n, x=50000, f,  k=0;
  



int main()
{
    cin>>n;
    
	c[0]=-1;
   for (i=1; i<=n; ++i)
         cin>>a[i], c[i]=a[i];
         
    sort(c+1, c+n+1);
    
    for (i=1; i<=n; ++i)
     if (c[i]!=c[i-1])
     	r[++k]=c[i];
     	
     	if (k==1) x=1;
     		
    for (i=1; i<=n; ++i)
    	if (r[1]==a[i])
    	{ 
    		f=1;
    		for (j=i+1; j<=n; ++j)
    		{ 
    			if (a[j]==r[f+1])
    			{
    				++f;
    				if (f==k) {x=min(x, j-i+1);  break; }
    			
				}
    			
			}
		}
     	
    if (x==50000) cout<<0; else cout<<x;
    
    
	
         
    return 0;
}