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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main
{
	public static void main(String[] args) throws NumberFormatException, IOException
	{
		  InputStreamReader in = new InputStreamReader(System.in);
		  BufferedReader input = new BufferedReader(in);
		  int n = Integer.parseInt(input.readLine().trim());
		  
		  int[] arr = new int[n];
		  int min = Integer.MAX_VALUE;
		  
		  String str = input.readLine();
		  String[] tok = str.split(" ");
		  for(int i = 0; i < n; i++)
		  {
			  arr[i] = Integer.parseInt(tok[i]);
			  if(min >= arr[i])
			  {
				  min = arr[i];
			  }
		  }
		  int l = -1;
		  int ans = Integer.MAX_VALUE;
		  for(int i = 0; i < n; i++)
		  {
			  if(arr[i] == min)
			  {
				  if(l >= 0)
				  {
					  ans = Math.min(ans, i - l);
				  }
				  l = i;
			  }
		  }
		  System.out.println(ans);
	}
}


