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

public class Main {
	public static void main(String[] args){
		Scanner s = new Scanner(System.in);
		
		int n = s.nextInt();
		int minNumber = 1000000000;
		int result = n;
		s.nextLine();
		String buf = s.nextLine();
		StringTokenizer st = new StringTokenizer(buf);
		
		int a[] = new int[n];
		int minLoc[] = new int[n];
		int locCount = 0;
		
		for(int i = 0; i < n ; i++){
			a[i] = Integer.parseInt(st.nextToken());
			if(a[i] < minNumber){
				minNumber = a[i];
				locCount = 0;
			}
			if(a[i] == minNumber){
				minLoc[locCount] = i;
				locCount++;
			}
				
		}
		
		
		for(int i = 0; i < locCount-1 ; i++){
			if(minLoc[i+1]-minLoc[i] < result)
				result = minLoc[i+1]-minLoc[i];
		}
		
		System.out.println(result);
		
	}
}
