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.math.BigInteger;
import java.util.*;

public class Solution {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n,mn=Integer.MAX_VALUE,ind=0,i;
        int a[];
        int ans=Integer.MAX_VALUE;
        n=sc.nextInt();
        a=new int[n];
        for ( i = 0; i < n; i++) {
            a[i]=sc.nextInt();
            if(mn>a[i])
            {
                mn=a[i];
                ind=i;
            }
        }
        i = ind+1;
        for (; i < n; i++)
        {
            if(a[i]==mn)
            {
                ans=Math.min(ans, i-ind);
                ind=i;
            }
        }
        System.out.println(ans);
    }
}
