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.ArrayList;
	import java.util.Arrays;
	import java.util.Collections;
	import java.util.Scanner;
	public class mege {
		public static void main(String[] args) {
			// TODO Auto-generated method stub
		     Scanner sc = new Scanner(System.in);
		     int n = sc.nextInt();
		      ArrayList<Integer> arr = new ArrayList<>();
		      int mini = Integer.MAX_VALUE;
		     for(int i = 0 ; i < n ; i++) {
		    	 int next = sc.nextInt();
		    	 arr.add(next);
		    	 mini = Math.min(mini, next);
		     }
		     int first = -1000000;
		     int count = 0;
		     int minAnswer = Integer.MAX_VALUE;
		     for(int i = 0 ; i < n ; i++) {
                  if(arr.get(i) == mini) {
                	  minAnswer = Math.min(minAnswer, i - first);
                	  first = i;
                  }
		     }
		     System.out.println(minAnswer);
		}
	}
