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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class cdd {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		int n=Integer.parseInt(br.readLine());
		StringTokenizer st=new StringTokenizer(br.readLine());
		int [] e=new int[n];
		int min= (int) 2e9;
		for(int i=0;i<n;++i)
		{	e[i]=Integer.parseInt(st.nextToken());
			if(e[i]<min)
				min=e[i];
		}
		int dis=1000080;
		int lstI=-1;
		for(int i=0;i<n;++i) {
			if(e[i]==min) {
				if(lstI==-1)
					lstI=i;
				else {
					if(i-lstI<dis)
						dis=i-lstI;
					lstI=i;
				}
			}
		}
		System.out.println(dis);
	}
}
