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 mins {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		int[] nums = new int[n];
		StringTokenizer st = new StringTokenizer(br.readLine());
		int min = Integer.MAX_VALUE,
				minDist = Integer.MAX_VALUE;
		for(int i = 0; i < n; i++) {
			nums[i] = Integer.parseInt(st.nextToken());
			if(nums[i] < min) min = nums[i];
		}
		for(int i = 0; i < n - 1; i++) {
			if(nums[i] == min) {
				int currDist = 0, count = 0;;
				for(int j = i + 1; j < n; j++) {
//					System.out.print(nums[j] + " ");
					count = j;
					currDist++;
					if(nums[j] == min) break;
					else if(j == n - 1) currDist = Integer.MAX_VALUE;
				}
				if(currDist < minDist) minDist = currDist;
				i = count - 1;
//				System.out.println(i);
			}
		}
		System.out.println(minDist);
	}
}
