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.*;


public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        ArrayList<Integer>arrayList1 = new ArrayList<>();
        ArrayList<Integer>arrayList2 = new ArrayList<>();
        int count =0;
        int min =0;
        for(int i =0; i<n;i++){
            int a = scanner.nextInt();
            arrayList1.add(a);
            arrayList2.add(a);
        }
        Collections.sort(arrayList1);
        for(int i =0; i<arrayList1.size()-1;i++){
            if(arrayList1.get(i).equals(arrayList1.get(i+1))){
                min=arrayList1.get(i);
                break;
            }
        }

        ArrayList<Integer> dist = new ArrayList<>();
        for(int i = arrayList2.indexOf(min)+1;i<arrayList2.size();i++){
            count++;
            if(arrayList2.get(i)==min){
                dist.add(count);
                count=0;
            }

        }
        System.out.println(Collections.min(dist));
    }

}



