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.ArrayList;
import java.util.Collections;
import java.util.Scanner;


public class Main {
    public static void main(String[] args) {
        Scanner scan=new Scanner(System.in);
        ArrayList<Integer> list=new ArrayList<Integer>();
        ArrayList<Integer> list1=new ArrayList<Integer>();
        ArrayList<Integer> list2=new ArrayList<Integer>();
        int n,min,var,loc=0,min1,loc1=0,ans,size;
        n=scan.nextInt();
        for(int i=0;i<n;i++){
            var=scan.nextInt();
            list.add(var);
        }
        min=list.get(0);
        for(int i=0;i<n;i++){
            if(min>list.get(i)){
                min=list.get(i);
                loc=i;
            }
        }
        list.remove(loc);
        list1.add(loc);
        for(int i=0;i<n-1;i++){
            if(list.get(i).equals(min)){
                list1.add(i+1);
            }
        }
        for(int i=0;i<list1.size();i++){
            if(i==list1.size()-1){
                break;
            }
            list2.add(list1.get(i+1)-list1.get(i));
        }
        min1=list2.get(0);
        for(int i=0;i<list2.size();i++){
            if(min1>list2.get(i)){
                min1=list2.get(i);
            }
        }
        System.out.println(min1);
    }
}
