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.*;

public class A {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = s.nextInt();
        }

        int min = arr[0];
        for (int i = 1; i < n; i++) {
            if (arr[i] < min) {
                min = arr[i];
            }
        }

        int[] mins = new int[n];
        Arrays.fill(mins, -1);
        int j = 0;
        for (int i = 0; i < n; i++) {
            if (arr[i] == min) {
                mins[j] = i;
                j++;
            }
        }

        int[] diff = new int[n];
        Arrays.fill(diff, -1);
        for (int i = 1; i < n && mins[i] > -1; i++) {
            diff[i] = mins[i] - mins[i - 1];
        }

        int diffMin = diff[1];
        for (int i = 2; i < n && diff[i] > -1; i++) {
            if (diff[i] < diffMin) {
                diffMin = diff[i];
            }
        }
        System.out.println(diffMin);
    }
}
