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
#http://codeforces.com/problemset/problem/911/A

inp = int(input())
item = list(map(int, input().split()))
m = min(item)
lis = []

for x in range (inp):
	if item[x] == m:
		lis.append(x)


lislen=len(lis)

for x in range(lislen-1):
	if x == 0 and lislen > 1:
		mindis = abs(lis[x]-lis[x+1])
	else:
		temp = abs(lis[x]-lis[x+1])
		if(mindis > temp):
			mindis = temp

print(mindis)
	