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 NearestMinimums {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();

        ArrayList<Integer> numbers = new ArrayList<Integer>();

        for (int i = 0; i < n; i++)
            numbers.add(s.nextInt());

        int minimum = Collections.min(numbers);

        ArrayList<Integer> minimums = new ArrayList<Integer>();

        for (int i = 0; i < n; i++) {
            int currentValue = numbers.get(i);

            if (minimum == currentValue) {
                int indexOfMinimum = i;
                minimums.add(indexOfMinimum);
            }
        }

        int difference = -1;

        for (int i = 0; i < minimums.size(); i++) {
            if (i < minimums.size() - 1) {
                int currentElement = minimums.get(i);
                int nextElement = minimums.get(i + 1);
                int diff = Math.abs(nextElement - currentElement);

                if (difference == -1 || diff < difference)
                    difference = diff;
            }
        }

        System.out.println(difference);
    }
}