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;

public class Main2 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n];
		for(int x = 0; x<n; x++)
			arr[x] = sc.nextInt();
		sc.close();
		int min = Integer.MAX_VALUE;
		for(int x : arr)
			min = Math.min(x, min);
		boolean foundlready = false;
		int dist = 0;
		int distmin = Integer.MAX_VALUE;
		for(int x : arr){
			if(min == x && foundlready){
				dist++;
				distmin = Math.min(distmin, dist);
				dist = 0;
			}
			else if(min == x)
			foundlready = true;
			else if(foundlready)
				dist++;
		}
		System.out.println(distmin);
	}
}


