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(raw_input())
l = list(map(int, raw_input().split()))
min = 1000000001
currentInd = 0
nextInd = 0
for i in range(0, n):
	if l[i] < min:
		min = l[i]
		currentInd = i
mind = 1000000001

for i in range(0, len(l)):
	if l[i] == min and i != currentInd:
		nextInd = i
		if nextInd - currentInd < mind:
			mind = nextInd - currentInd
		currentInd = i

print(mind)