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 p911A {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		ArrayList<Integer> list = new ArrayList<Integer>();
		
		
		for (int i = 0; i < n; i++) {
			list.add(scan.nextInt());
		}
		
		
		int min = min(list);
		ArrayList<Integer> indexes = index(list, min);
		min = Integer.MAX_VALUE;	
		
		for (int i = 1; i < indexes.size(); i++) {
			min = Math.min(min, indexes.get(i) - indexes.get(i - 1));
		}
		
		System.out.println((min == Integer.MAX_VALUE) ? 0 : min);

	}

	public static int min(ArrayList<Integer> in) {
		int m = Integer.MAX_VALUE;
		for (int i = 0; i < in.size(); i++)
			m = Math.min(m, in.get(i));
		return m;
	}

	public static ArrayList<Integer> index(ArrayList<Integer> in, int min) {
		ArrayList<Integer> ans = new ArrayList<Integer>();
		for (int i = 0; i < in.size(); i++) {
			if (in.get(i) == min)
				ans.add(i);
		}
		return ans;
	}

}
