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 = input().split()

ls = []

for i in range(len(a)):
	ls.append((int(a[i]),i))

ls = sorted(ls)

ans = 3000300300
    
mn = ls[0][0]
last = -1
for val in ls:
	if val[0]>mn:
		break
	if last!=-1:
		ans = min(ans,val[1]-last)
	last = val[1]
print(ans)
	