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 class Main {
 	
    public static void main(String args[]) throws IOException {

        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        StringBuilder out = new StringBuilder();
        StringTokenizer tk;
        
        int n = Integer.parseInt(in.readLine());
        int[] arr = new int[n];
        
        tk = new StringTokenizer(in.readLine());
        int min = Integer.MAX_VALUE, index = -1;
        for (int i = 0; i < n; i++) {
            int a = Integer.parseInt(tk.nextToken());
            arr[i] = a;
            
            if(a < min) {
                index = i;
                min = a;
            }
        }
        
        int ans = Integer.MAX_VALUE;
        int currInd = index;
        for (int i = index+1; i < n; i++) {
            if(arr[i] == min) {
                if((i - currInd) < ans)
                    ans = i - currInd;
                
                currInd = i;
            }
        }
        
        System.out.println(ans);
    }
}