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
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */


import java.util.ArrayList;
import java.util.Iterator;
import java.util.Scanner;

/**
 *
 * @author MasterZhao
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        ArrayList<Long> a = new ArrayList<>();
        ArrayList<Integer> index = new ArrayList<>();
        long min = 1000000000;
        for (int i = 0; i < n; i++) {
            a.add(input.nextLong());
            if (a.get(i) < min) {
                min = a.get(i);
            }
        }
        int num = 0;
        for (int i = 0; i < n; i++) {
            if (a.get(i)==min) {
                index.add(i);
                num++;
            }
        }
        int mindistance = 100000;
        for (int i = 0; i < num-1; i++) {
            if (index.get(i+1)-index.get(i)<mindistance) {
                mindistance = index.get(i+1)-index.get(i);
            }
        }
        System.out.println(mindistance);
        
    }
    
}
