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

public class problem208 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		ArrayList<Long> ar = new ArrayList<>();
		long min = Integer.MAX_VALUE;
		for(int i = 0;i<n;i++)
		{
			long x = sc.nextLong();
			ar.add(x);
			if(x<min)
				min = x;
		}
		int minvalue = Integer.MAX_VALUE;
		//System.out.println(min+"  yy  yy");
		int z = ar.indexOf(min);
		//System.out.println(z+" k k k k ");
		int w=0;
		for(int i = z+1;i<n;i++)
			
		{
			
			if(ar.get(i)==min)
			{
				w = i-z;
				if(w<minvalue)
					minvalue = w;
				z = i;
			}
		}
		System.out.println(minvalue);
			

	}

}
