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.io.*;
import java.lang.*;
import java.util.*;
public class A
{
    public static class Pair
    {
        int f;
        int s;
    };
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int a[]=new int[n];
        ArrayList<Pair> arr=new ArrayList<>();
        for(int i=0;i<n;i++)
        {
            a[i]=sc.nextInt();
            Pair p=new Pair();
            p.f=a[i];
            p.s=i;
            arr.add(p);
        }
        Collections.sort(arr,new Comparator<Pair>()
        {
            public int compare(Pair a,Pair b)
            {
                if(a.f==b.f)
                return a.s-b.s;
                else
                return a.f-b.f;
            }
        });
        int ans=Integer.MAX_VALUE;
        for(int i=0;i<arr.size()-1;i++)
        {
            if(arr.get(i).f==arr.get(i+1).f)
            ans=Math.min(Math.abs(arr.get(i).s-arr.get(i+1).s),ans);
            else
            break;
        }
        System.out.println(ans);
    }
}