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 IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(br.readLine());
        String[] tokens = br.readLine().split("\\s");

        int min = Integer.MAX_VALUE;
        long smallestDistance = Long.MAX_VALUE;
        int distance = 0;
        for (String token : tokens) {
            int num = Integer.parseInt(token);
            if (num < min) {
                min = num;
                distance = 0;
                smallestDistance = Long.MAX_VALUE;
            } else if (num == min) {
                if (distance < smallestDistance) {
                    smallestDistance = distance;
                }
                distance = 0;
            }
            distance++;
        }

        System.out.print(smallestDistance);
    }
}
