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 ClosestMinimums {
public static void main(String[] args) {
	Scanner scan = new Scanner(System.in);
	int n = scan.nextInt();
	int[] arr = new int[n];
	for(int i = 0 ; i<arr.length;i++)
	{
		arr[i] = scan.nextInt();
	}
	int mindexes[] = new int[n];
	int min = Integer.MAX_VALUE;
	for(int a:arr)
		if(a<min)
			min =a;
	int c= 0;
	for(int i = 0 ; i < arr.length;i++)
	{
		if(arr[i]==min)
			mindexes[c++] = i;
	}
	min = mindexes[1] - mindexes[0];
	for(int i = 2;i<arr.length&&mindexes[i]>0;i++)
	{
		if(mindexes[i]-mindexes[i-1]<min)
			min = mindexes[i]-mindexes[i-1];
	}
	System.out.println(min);
}
}
