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

public class Main{

	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		int n=Integer.parseInt(scanner.nextLine());
		String s[]=scanner.nextLine().split(" ");
		int[] arr=new int [n];
		int min=Integer.MAX_VALUE;
		Vector<Integer> ind=new Vector<>();
		for(int i=0;i<n;i++) {
			arr[i]=Integer.parseInt(s[i]);
			if(arr[i]<min) {
				min=arr[i];
				ind.clear();
				ind.add(i);
			}else if(arr[i]==min) {
				ind.add(i);
			}
		}
		//for(int i=0;i<ind.size();i++) 
			//System.out.println(ind.get(i));
		int minind=Integer.MAX_VALUE;
		for(int i=1;i<ind.size();i++) {
			minind=minind<(ind.get(i)-ind.get(i-1))?minind:(ind.get(i)-ind.get(i-1));
		}
		System.out.println(minind);
		
		

	}

}

   		  	 		  	 		  	 	 	 		  	