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 NearestMinimums {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scn=new Scanner(System.in);
		int n=scn.nextInt();
		int []arr=new int[n];
		int min=Integer.MAX_VALUE;
		int sidx=0;
		int eidx=0;
		int temp=0;
		for(int i=0;i<n;i++)
		{
			arr[i]=scn.nextInt();
			if(arr[i]<min)
			{
				min=arr[i];
				sidx=i;
			}
			else if(arr[i]<=min)
			{
				//System.out.println(i+" "+eidx+" "+sidx+" "+temp);
				if(eidx<=sidx)
				{
					eidx=i;
					temp=i;
				}
				else
				{
					if(i!=eidx&&eidx-sidx>i-temp)
					{
						//System.out.println("ggg");
						sidx=temp;
						eidx=i;
						temp=i;
					}
					else
					{
						temp=i;
					}
				}
			}
		}
		System.out.println(eidx-sidx);
	}

}
