#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

ifstream fin("secv.in");
ofstream fout("secv.out");

int a[6000], f[6000];
vector <int> s;
int n, i, lmin(-1), l, k;

int main()
{
    fin >> n;
    for (i = 0; i < n; ++i)
    {    
        fin >> a[i];
        f[i] = a[i];
    }    
    fin.close();
    sort(f, f + n);
    for (i = 0; i < n; ++i)
    {
        while (i < n && f[i] == f[i+1]) i++;
        s.push_back(f[i]);
    }
   
    for (i = 0; i < n; i++)
        if (a[i] == s[0])
        {
            l = i;
            k = 1;
            while (l < n && k != s.size()-1)
            {
                if (a[l] == s[k]) k++;
                l++;
            }
            if (k == s.size()-1)
            {
                if (l-i > lmin) lmin = l-i+1;
            }
        }
    fout << lmin << '\n';
    fout.close();
    return 0;
}