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

public class NearestMin {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);
		
		int n = Integer.parseInt(sc.nextLine());
		StringTokenizer st = new StringTokenizer(sc.nextLine());
		int[] numbers = new int[n];
		for(int i = 0; i < n; i ++) {
			numbers[i] = Integer.parseInt(st.nextToken());
		}
		
		sc.close();
		
		int min = numbers[0];
		for(int i = 0; i < n; i++) {
			if(min > numbers[i])
				min = numbers[i];
		}
		
		ArrayList<Integer> occ = new ArrayList<Integer>();
		for(int i = 0; i < n; i++) {
			if(min == numbers[i])
				occ.add(i);
		}
		
		ArrayList<Integer> diff = new ArrayList<Integer>();
		for(int i = 0; i < occ.size() - 1; i ++) {
			diff.add(occ.get(i+1)-occ.get(i));
		}
		
		int mindiff = diff.get(0);
		for(int i = 0; i < diff.size(); i++)	{
			if(mindiff > diff.get(i))
				mindiff = diff.get(i);
		}
		
		pw.print(mindiff);
		pw.close();
	}
}
