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 Codeforces911A {
	public static void main(String[] args) throws IOException {
		//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		//String[] sp = br.readLine().split(" ");
		Scanner input = new Scanner(System.in);
		int n = input.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = input.nextInt();
		}
		
		int min = 1000000001;
		int first = -1;
		for (int i = 0; i < n; i++) {
			if (a[i] < min) {
				min = a[i];
				first = i;
			}
		}
		
		int ans = 1000000001;
		int counter = 0;
		for (int i = first+1; i < n; i++) {
			counter++;
			if (a[i] == min) {
				ans = Math.min(ans, counter);
				counter = 0;
			}
		}
		
		System.out.println(ans);
		
	}
}
