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.util.*;


public class cf88{
	public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        TreeMap<Integer,Integer> tm = new TreeMap<Integer,Integer>();
        int min = 1000000000;
        int[] aa = new int[n];
        for(int i=0;i<n;i++){
           aa[i] = sc.nextInt();
           min = Math.min(min,aa[i]);
        }
        //System.out.println(min);

        int i=0;
        int ind=-1;
        while(aa[i]!=min){
           i++;
        }

        ind = i;
        //System.out.println(ind);
        int min2 = 1000000000;
        for(int j=i+1;j<n;j++){
           if(aa[j]==min){
           	  min2 = Math.min(min2,j-ind);
           	  ind = j;
           }
        }

        System.out.println(min2);



	}
}