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 Main {

    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);

        int arrayLength = Integer.parseInt(input.nextLine());
        String[] inputArray = input.nextLine().split(" ");
        ArrayList<Integer> array = new ArrayList<>();
        for(int i = 0; i < arrayLength; i++) array.add(Integer.parseInt(inputArray[i]));

        int minElementArray = Collections.min(array);
        ArrayList<Integer> minimums = new ArrayList<>();

        int count = 0;
        for (int element : array)
        {
            if(element == minElementArray) minimums.add(count);
            count++;
        }

        Collections.sort(minimums);
        ArrayList<Integer> resultsMinimums = new ArrayList<>();
        int index = 0;
        int elem = 0;
        for (int element : minimums)
        {
            if(index != 0) resultsMinimums.add(element - elem);
            elem = element;
            index++;
        }

        System.out.println(Collections.min(resultsMinimums));
    }
}