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
N = int(input())

numbers = list(zip(map(int, input().split()), range(N)))
# print (numbers)
least = min([x[0] for x in numbers])
# print (least)
numbers.sort(key=lambda x: x[1])
numbers.sort(key=lambda x: x[0])
num = list(filter(lambda x: x[0]==least, numbers))
minimum_dist = len(numbers)
# print (num)
for i in range(len(num)-1):
	x = num[i+1][1]-num[i][1]
	# print (x)
	if minimum_dist > x:
		minimum_dist = x
print (minimum_dist)

