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


public class scorify{
	public static void main(String[] args){
	Scanner in=new Scanner(System.in);
    int n = in.nextInt(),temp;
    Map<Integer,ArrayList<Integer>> map = new HashMap<Integer,ArrayList<Integer>>();
    TreeSet<Integer> min = new TreeSet<Integer>();
    
    for(int i=0 ; i<n ;i++){
        temp = in.nextInt();
        min.add(temp);
        if(!(map.containsKey(temp))){
            ArrayList<Integer> ar = new ArrayList<Integer>();
            map.put(temp,ar);
            map.get(temp).add(i);
        }else{
            map.get(temp).add(i);
        }
    }
    
    TreeSet<Integer> set = new TreeSet<Integer>();
    int m = min.first();
        for(int i=1 ; i<map.get(m).size() ;i++){
            set.add(map.get(m).get(i)-map.get(m).get(i-1));
        }
    System.out.println(set.first());
	
	
	}
}