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.*;


public class Codeforces {
	
	
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		int n= in.nextInt();
		int i=0;
		long a[] = new long[n];
		for(i=0;i<n;i++)
		{
			a[i]= in.nextInt();
		}
		
		long min=Integer.MAX_VALUE;
		for(i=0;i<a.length;i++)
		{
			if(a[i]<min)
			{
				min=a[i];
			}
		}
		List<Integer> l = new ArrayList<Integer>();
		for(i=0;i<a.length;i++)
		{
			if(a[i]==min)
			{
				l.add(i);
			}
			
		}
		long res=Integer.MAX_VALUE;
		for(i=0;i<l.size()-1;i++)
		{
			int k= l.get(i+1)-l.get(i);
			if(k<res)
			{
				res=k;
			}
			
		}
		System.out.println(res);
		
		
		
	}

}

