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

/*
 @author Ramanpreet Singh on 31/01/18
 *
 */
public class Solution3 {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        int a[] = new int[n];
        int min=1000000000;

        for (int i = 0; i < n; i++) {
            a[i] = scanner.nextInt();

            if(a[i]<min){
                min=a[i];
            }
        }

        int start=-1,minDistance=1000000000;
        for(int i=0;i<n;i++){

            if(a[i]==min){
                if(start==-1){
                    start=i;
                }else{
                    minDistance = Math.min(minDistance,i-start);
                    start=i;
                }
            }

        }

        System.out.println(minDistance);
    }
}
