#include<iostream>

#include<cstring>

#include<cmath>

#include<queue>

#include<algorithm>

#include<cstdio>

#include<map>

using namespace std;

#define LL long long

#define INF 0x3f3f3f3f

const int N=;

int p,a[N];

map<int,int>n,x;

int main()

{

    while(~scanf("%d",&p))

    {

        for(int i=;i<=p;i++)

        {

            scanf("%d",&a[i]);

            n[a[i]]++;

        }

        int s=n.size();    //记录总类别

        int l=,r=,ans=INF;

        while(true)

        {

            while((r<=p)&&(x.size()<s)){    //尺取法，要满足范围要求，否则右端点移动

                x[a[r++]]++;

            }

            if(x.size()<s)break;

            ans=min(ans,r-l);

            x[a[l++]]--;

            if(x[a[l-]]<=)x.erase(a[l-]);    //关健点，在范围内这个类别数<=0，就删去

        }

        printf("%d\n",ans);

    }

    return ;

}