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
from __future__ import division
from math import ceil
from bisect import bisect_right as b_r
from bisect import bisect_left as b_l
a = input()
ar = map(int , raw_input().split())
dic = {}
for i in range(0, a):
	if ar[i] in dic:
		dic[ar[i]].append(i)
	else:
		dic[ar[i]] = [i]
x = min(ar)
mi = 10**9
for i in range(1, len(dic[x])):
	if mi >  dic[x][i] - dic[x][i-1]:
		mi = dic[x][i] - dic[x][i-1]
print mi 

	

	
