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

public class Main 
{
	static int []arr;
	static int mini = 1234567890;
	public static void main(String[] args) 
	{
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		arr = new int[110000];
		int n = sc.nextInt();
		for (int i = 1;i <= n;++i)
		{
			arr[i] = sc.nextInt();
			mini = Math.min(arr[i],mini);
		}
		int min_dis = n+1;
		int last = -12345678;
		for (int i = 1;i <= n;++i)
		{
			if (arr[i] == mini)
			{
				min_dis = Math.min(min_dis,i-last);
				last = i;
			}
		}
		System.out.println(min_dis);
	}
}
