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.*;
import java.io.*;
public class codeforces
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int arr[]=new int[n];
        int min=1000000010;
        for(int i = 0;i<n;i++)
        {
            arr[i]=sc.nextInt();
            min=Math.min(min,arr[i]);
        }
        int dis=0;
        int store=-1;
        int mindis=9999999;
        for(int i =0;i<n;i++)
        {
            if(arr[i]==min)
            {
                if(store==-1)
                store=i;
                else
                {
                    mindis=Math.min(i-store,mindis);
                    store=i;
                }
            }
        }
        System.out.println(mindis);
    }
}