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

public class Main {

    public static void main(String[] args) throws Exception {

        BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
        int numOfElements = Integer.parseInt(input.readLine());
        String readNums = input.readLine();
        String[] n = readNums.split("\\s");
        int[] numbers = new int[numOfElements];

        for (int i = 0; i < numOfElements; i++) {
            numbers[i] = Integer.parseInt(n[i]);
        }

        int min = numbers[0];
        int lengthPos1 = 0;
        int lengthPos2 = -1;
        int length = numOfElements;

        for (int i = 0; i < numOfElements; i++) {
            if (numbers[i] < min) {
                min = numbers[i];
            }
        }

        for(int i = 0; i < numOfElements; i++) {
            
            if(min == numbers[i]) {
                if(lengthPos2 == -1) {
                    lengthPos2 = lengthPos1;
                    lengthPos1 = i;
                    continue;
                }
                
                lengthPos2 = lengthPos1;
                lengthPos1 = i;
                
                if(lengthPos1-lengthPos2 < length && lengthPos1 != lengthPos2){
                    length = lengthPos1-lengthPos2;
                }
            }
        }

        System.out.println(length);
    }
}
