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())
A = list(map(int, input().split()))

# print(A)

m = 10 ** 9 + 1
mi = []

for i in range(len(A)):
	x = A[i]

	if (x < m):
		mi = []
		m = x

	if (x == m):
		mi.append(i)

# print(mi)
md = 10 ** 5 + 1
for i in range(1, len(mi)):
	if (mi[i] - mi[i-1] < md):
		md = mi[i] - mi[i-1]

print(md)


