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
// http://codeforces.com/problemset/problem/911/A

import java.util.Scanner;

public class Solution {

	public static void main(String[] args) {
		Scanner read = new Scanner(System.in);
		
		int n = read.nextInt();

		int min = Integer.MAX_VALUE;
		int minIndex = -1;
		
		int[] a = new int[n];
		for (int i = 0; i < n; ++i) {
			a[i] = read.nextInt();
			if (a[i] < min) {
				min = a[i];
				minIndex = i;
			}
		}
		
		int minDifference = Integer.MAX_VALUE;
		for (int i = minIndex+1; i < n; ++i) {
			if (a[i] == min) {
				int difference = Math.abs(i - minIndex);
				if (difference < minDifference) {
					minDifference = difference;
				}
				minIndex = i;
			}
		}
		
		System.out.println(minDifference);
		
		// Close scanner
		read.close();
	}

}