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())
l=list(map(int,input().split()))
m=min(l)
ans=[]
if(l.count(m)>1):
	for i in range(n):
		if(l[i]<=m):
			m=l[i]
			ans.append(i)
	ans=sorted(ans)
	a=10**9
	for i in range(1,len(ans)):
		if(abs(ans[i]-ans[i-1]))<a:
			a=abs(ans[i]-ans[i-1])
	print(a)
else:
	m1=l.index(min(l))
	l.pop(min(l))
	m2=l.index(min(l))
	if(abs(m1-m2)==0):
		print("1")
	else:
		print(abs(m1-m2))
	
	
		
	
	
	
	