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;

public class EF02
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);

        int n = in.nextInt();

        int A[] = new int[n], min = Integer.MAX_VALUE, ans = Integer.MAX_VALUE, pos = 0;


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

            if(A[i] == min)
            {
                if((i-pos) < ans)
                    ans = i - pos;

                pos = i;
            }

            if (A[i] < min)
            {
                min = A[i];
                pos = i;
                
                ans = Integer.MAX_VALUE;
            }

        }

        System.out.println(ans);
    }
}