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.*;
import java.util.*;

public class Solution {
    public static void main(String[] args) {
        Solution solution = new Solution();
        solution.solve();
    }
    
    private int n;
    
    public void solve() {
        InputReader in = new InputReader();

        n = in.nextInt();
        int[] input = new int[n];
        int min = Integer.MAX_VALUE;
        for(int i = 0; i < n; i++) {
            input[i] = in.nextInt();
            if(input[i] < min) {
                min = input[i];
            }
        }
        
        int prev = -1, close = Integer.MAX_VALUE;
        for(int i = 0; i < n; i++) {
            if(input[i] == min) {
                if(prev != -1 && i-prev < close) {
                    close = i-prev;
                }
                prev = i;
            }
        }
        
        System.out.println(close);
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader() {
            reader = new BufferedReader(new InputStreamReader(System.in), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}