#include <bits/stdc++.h>
using namespace std;
ifstream in("secv.in");
ofstream out("secv.out");
const int N = 5005;
int v[N],dp[N],lst[N];
int main()
{
    int n;
    in >> n;
    for (int i = 1; i<=n; i++)
    {
        in >> v[i];
        lst[i] = v[i];
    }
    int k = 0;
    sort(lst+1,lst+n+1);
    for (int i = 1; i<=n; i++)
        if (lst[i]!=lst[k])
            lst[++k] = lst[i];
    for (int i = 1; i<=n; i++)
        v[i] = lower_bound(lst+1,lst+k+1,v[i])-lst;
    int ans = INT_MAX;
    for (int i = 1; i<=n; i++)
    {
        int el = 1, j;
        for (j = i; j<=n; j++)
            if (v[j] == lst[el])
            {
                el++;
                if (el>k)
                    break;
            }
        if (el>k)
            ans = min(ans,j-i+1);
    }
    if (ans == INT_MAX)
        out << -1;
    else
        out << ans;
}