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.io.*;
import java.util.*;

public class Main
{  
    public static void main(String[] args) throws IOException 
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            StringTokenizer st = new StringTokenizer(br.readLine());
            
            int n = Integer.parseInt(st.nextToken());
            int min, ans = Integer.MAX_VALUE, lastIdx = 0;
            
            st = new StringTokenizer(br.readLine());
            min = Integer.parseInt(st.nextToken());
            for(int i=1; i<n; i++)
            {
                  int a = Integer.parseInt(st.nextToken());
                  if(a < min)
                  {
                      min = a;
                      lastIdx = i;
                      ans = Integer.MAX_VALUE;
                  }
                  else if(a == min)
                  {
                      ans = Math.min(i - lastIdx,ans);
                      lastIdx = i;
                  }
            }
            System.out.println(ans);
    }
}