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 Main{
	public static void main(String[] args) throws NumberFormatException, IOException{
	    
	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	    
	    //Get length of array
	    int n = Integer.parseInt(br.readLine().trim());
	    
	    //Initialize array and first min value placeholder
	    int[] array = new int[n];
	    int min = Integer.MAX_VALUE;
	    
	    String str = br.readLine();
	    //Get each integer on second line of input
	    String[] token = str.split(" ");
	    
	    //Getting min and populating array
	    for(int i = 0; i < n; i++){
	        array[i] = Integer.parseInt(token[i]);
	        if(min >= array[i])
	            min = array[i];
	    }
	    
	    int length = -1;
	    int answer = Integer.MAX_VALUE;
	    
	    //Iterate through the array, using length to track distances between min values
	    for(int k = 0; k < n; k++){
	        if(array[k] == min){
	            if(length >= 0)
	                answer = Math.min(answer, k - length);
	            length = k;
	            
	        }
	    }
	    
	    System.out.println(answer);
	    
	}
}