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.Arrays;
import java.util.Scanner;

public class question1 {

	public static void main(String[] args) {
	
		Scanner s = new Scanner(System.in);
		
		int n=s.nextInt();
		
		long[] a =  new long[n];
		
		long min=Long.MAX_VALUE;
		
		for(int i=0;i<n;i++){
			a[i]=s.nextLong();
			if(a[i]<min){
				min=a[i];
			}
		}
		
	
		
		
		

		int[] ans = new int[n];
		int k=0;
		
		for(int i=0;i<n;i++){
			if(a[i]==min){
				ans[k]=i;
				k++;
			}
		}
		
		long min1=Integer.MAX_VALUE;
		
		for(int i=1;i<k;i++){
			if(ans[i]-ans[i-1]<min1){
				min1=ans[i]-ans[i-1];
			}
		}

		System.out.println(min1);
	}

}
