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

public final class Main {


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

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int n = Integer.parseInt(st.nextToken());
        st = new StringTokenizer(br.readLine());

        long[] arr = new long[n];
        int minNumIndex = 0;
        long minNumDist = Long.MAX_VALUE;

        for(int i = 0; i<n; i++){
            arr[i] = Long.parseLong(st.nextToken());
            if(i>0 && arr[i] < arr[minNumIndex]){
                minNumIndex = i;
                minNumDist = Long.MAX_VALUE;
            }else if(i>0 && arr[i] == arr[minNumIndex]){
                minNumDist = Math.min(minNumDist, i - minNumIndex);
                minNumIndex = i;
            }
        }

        System.out.println(minNumDist);
    }
}
