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;

public class Main {
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n= Integer.parseInt(br.readLine());
		String[]a = br.readLine().split(" ");
		int[] f = new int[n];
		int ps = 0;
		int cont = n+2;
		f[0]=Integer.parseInt(a[0]);
		for (int i = 1; i < n; i++) {
			f[i]=Integer.parseInt(a[i]);
			if(f[ps]>f[i]) {
				ps = i;
				cont  = n+2;
			}else if(f[ps]==f[i] ) {
				if(cont >= (i-ps)) {
					cont = i-ps;
				}
				ps = i;
			}
			
		}
		
		
		System.out.println(cont);
	}

}
