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

public class test {
	public static void main(String[] args) throws IOException {
		Scanner s = new Scanner(System.in);
		int N = Integer.parseInt(s.nextLine());
		StringTokenizer st = new StringTokenizer(s.nextLine());
		int[] arr = new int[N];
		for (int i = 0; i < N; i++) {
			arr[i] = Integer.parseInt(st.nextToken());
		}
		int min = arr[0];
		int lastIndex = 0;
		int closest = Integer.MAX_VALUE;
		for (int i = 1; i < N; i++) {
			if (arr[i] < min) {
				min = arr[i];
				lastIndex = i;
				closest = Integer.MAX_VALUE;
			} else if (arr[i] == min) {
				int dist = i - lastIndex;
				if (dist < closest) {
					closest = dist;
				}
				lastIndex = i;
			}
		}
		System.out.println(closest);
		s.close();
	}
}