#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("secv.in");
ofstream out("secv.out");

const int maxim = 10000000, lmax = 5001;
long long lungime=maxim, n, m;
long long v[lmax], aux[lmax], sol[lmax];

int main()
{
	int player_unu=0;

    in>>n;
	for(int i = 1; i<=n; i++)
     {
        in>>v[i];
        aux[i]=v[i];
     }

     sort(aux+1, aux+n+1);

     aux[0]=-1;

     for (int i = 1; i<=n; i++)
		if (aux[i]!=aux[i-1])
			sol[++m] = aux[i];

     for (int ii=1; ii<=n; ii++)
     {
          int i = ii;
          int j = 1;

          while (i<=n)
          {
                if (v[i]==sol[j])
                 j++;

                if (j==m+1)
                 {
                     lungime=lungime<i-ii+1?lungime:i-ii+1;
                     break;
                 }
                i++;
          }
      }

   if (lungime!=maxim)
    out<<lungime;
   else
    out<<-1;

   return player_unu;
}