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;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.StringTokenizer;
import java.util.TreeMap;

/**
 *
 * @author rn-sshawish
 */
public class Contest911A {
    public static void main(String[] args) throws Exception {
        TreeMap<Integer,ArrayList<Integer>> d = new TreeMap<>();
        BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(input.readLine());
        StringTokenizer tokn = new StringTokenizer(input.readLine());
        for (int i = 0; i < n; i++) {
            int m = Integer.parseInt(tokn.nextToken());
            ArrayList<Integer> position = d.get(m);
            if (position!=null) {
                position.add(i);
            }else{
                position = new ArrayList<>();
                position.add(i);
                d.put(m, position);
            }
        }
        
        ArrayList<Integer> poList = d.get(d.firstKey());
        int min = Integer.MAX_VALUE;
        for (int i = 1; i < poList.size(); i++) {
            min = Math.min(min, poList.get(i) - poList.get(i-1));
        }
        System.out.println(min);
        
    }
}
