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

public class A{

    public static void main(String[] args)throws IOException{
	BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	int n = Integer.parseInt(in.readLine());
	String p[] = in.readLine().split(" ");
	int a[] = new int[n];
	int min = Integer.MAX_VALUE;
	for(int i = 0; i<n;i++){
	    a[i] = Integer.parseInt(p[i]);
	    min = Math.min(min,a[i]);
	}
	int ans = Integer.MAX_VALUE;
	int ul = -1;
	for(int i = 0; i<n;i++){
	    if(a[i]==min && ul==-1){
		ul = i;
	    }else if(a[i]==min){
		ans = Math.min(ans,i-ul);
		ul = i;
	    }
	}
	System.out.println(ans);
    }
}
