/*http://www.infoarena.ro/problema/secv*/
#include <fstream>
#include <unordered_map>
#define N 5001
using namespace std;
unordered_map<int, bool> mymap;
int v[N], st[N], sol[N], n, i, nr_dist;

int dinamica()
{
    int scmax = 1, i, j, minn = n;

    for(i=1; i<n; ++i)
    {
        for(j=i-1; j>=0; --j)
            if(v[j] < v[i] && (sol[i] < sol[j]+1 || (sol[i] == sol[j]+1 && st[j]>st[i])))
            {
                sol[i] = sol[j]+1;
                st[i] = st[j];
                if(sol[i] > scmax)
                    scmax = sol[i];
            }
    }
    ++scmax;
 //   if(scmax < nr_dist) return -1;

    for(i=0; i<n; ++i)
        if(sol[i] == nr_dist-1 && i - st[i] < minn)
            minn = i - st[i];
    return minn + 1;
}

int main()
{
    ifstream f("secv.in");
    ofstream g("secv.out");
    f >> n;
    for(i=0; i<n; ++i)
    {
        f >> v[i];
       // mymap.insert({v[i], true});
        st[i] = i;
    }
    nr_dist = mymap.size();
    g << dinamica();
    f.close();
    g.close();
    return 0;
}