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.InputStream;
import java.io.PrintStream;
import java.util.Scanner;

/**
 */
public class MainA {
	public static void main(String[] args) {
		run(System.in, System.out);
	}

	public static void run(InputStream in, PrintStream out) {

		try (Scanner sc = new Scanner(in)) {
			int n = sc.nextInt();

			int min = sc.nextInt();
			int last = 0;
			int diff = Integer.MAX_VALUE;
			for (int cur = 1; cur < n; cur++) {
				int i = sc.nextInt();
				if (i < min) {
					min = i;
					last = cur;
					diff = Integer.MAX_VALUE;
				} else if (i == min && cur - last < diff) {
					diff = cur - last;
					last = cur;
				} else if (i == min) {
					last = cur;
				}
			}

			out.print(diff);
		}
	}

}