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.*;
public class MyClass {
    public static void main(String args[]) {
          Scanner sc = new Scanner(System.in);
          int n = sc.nextInt();
          
          List<Integer> array = new ArrayList<Integer>();
          List<Integer> array1 = new ArrayList<Integer>();
          int sum=0,num,sum1=0;
          for(int i=0;i<n;i++)
          {
              num = sc.nextInt();
              array.add(num);
          }
          
          boolean carry=false;
          int min = Collections.min(array);
          for(int i=0;i<n;i++)
          {
            
            if(array.get(i)== min)
            {
                array1.add(i);
            }
            
          }
          
          int max=Integer.MAX_VALUE;
          for(int i=1;i<array1.size();i++)
          {
              if((array1.get(i)-array1.get(i-1))<max)
              {
                  max=(array1.get(i)-array1.get(i-1));
              }
          }
          
          System.out.println(max);
          
    }
}
