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 IOException
	{
//		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int[]a = new int[n];
		for(int i = 0; i < n;i++)
		{
			a[i] = in.nextInt();
		}
		int min = a[0];
		for(int x : a)
		{
			if(x < min) min = x;
		}
		
		int minDis = Integer.MAX_VALUE;
		int curPos = -1;
		for(int i = 0; i < n; i++)
		{
			if(a[i] == min && curPos == -1)
			{
				curPos = i;
			}
			else if(a[i] == min)
			{
				if(Math.abs(curPos - i) < minDis)
				{
					minDis = (Math.abs(curPos - i));
				}
				curPos = i;
				
			}
		}
		System.out.println(minDis);
	}
	
	
}
