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.Arrays;
import java.util.Scanner;

/**
 *
 * @author REDOANUL HAQUE
 */
public class NearestMinimums {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        Scanner ob=new Scanner(System.in);
        int n=ob.nextInt(),j=0,count=0,k=0,a=0,l=0;
        int ara[]=new int[n];
        int ara1[]=new int[n];
        for(int i=0;i<n;i++)
        {
            ara[i]=ob.nextInt();
            ara1[j]=ara[i];
            j++;
        }
        Arrays.sort(ara1);
        int x=ara1[0];
        for(int i=0;i<n;i++)
        {
            if(ara[i]==x)
                count++;
        }
        int ara2[]=new int[count];
        for(int i=0;i<n;i++)
        {
            if(ara[i]==x)
            {
                ara2[k]=i;k++;
               
            }
            
        }
        int ara3[]=new int[count-1];
        for(int i=0;i<count-1;i++)
        {
           a=ara2[i+1]-ara2[i];
           ara3[l]=a;l++;
        }
        
//           for(int i=0;i<count-1;i++)
//               System.out.println(ara3[i]);
        Arrays.sort(ara3);
        System.out.println(ara3[0]);
    }
    
}
