You are given an array of n integer numbers a0, a1, ..., an - 1. Find the distance between two closest (nearest) minimums in it. It is guaranteed that in the array a minimum occurs at least two times.

Input

The first line contains positive integer n (2 ≤ n ≤ 105) — size of the given array. The second line contains n integers a0, a1, ..., an - 1 (1 ≤ ai ≤ 109) — elements of the array. It is guaranteed that in the array a minimum occurs at least two times.

Output

Print the only number — distance between two nearest minimums in the array.

Examples

Input

2
3 3


Output

1


Input

3
5 6 5


Output

2


Input

9
2 1 3 5 4 1 2 3 1


Output

3
import java.util.*;
import java.io.*;



public class Main
{
    public static void main(String args[])
    {
        // String s=fs.next();
        //char c[]=s.toCharArray();
        //int len=s.length();
         InputStream in=System.in;
        FastScanner fs=new FastScanner(in);
        PrintWriter out=new PrintWriter(System.out);
      int n=fs.nextInt();
      int arr[]=new int[n];
       int min=1000000000;
       for(int i=0;i<n;i++)
         {
            arr[i]=fs.nextInt();
            if(arr[i]<min)
                min=arr[i];

         }
       int i=0;
        while(arr[i]!=min)
            i++;
        int prev=i;
        i++;

        int mindist=1000000;
        for(;i<n;i++)
            if(arr[i]==min)
            {
                if(i-prev<mindist)
                {
                    mindist=i-prev;
                    prev=i;
                }
                else
                    prev=i;
            }
            out.println(mindist);
         out.close();
    
    }
   static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(InputStream f) {
            try {
                br = new BufferedReader(new InputStreamReader(f));
            } catch (Exception e) {
                e.printStackTrace();
            }
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
         Long nextLong() {
            return Long.parseLong(next());
        }
        char [] charArray()
          {
            return  next().toCharArray();
          }
       



        
    }

}

