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=[]
y=[]
p=input().split(' ')
for i in range(n):
   l.append(int(p[i]))
e=l[:]
e.sort()
w=l.index(e[0])
t=1
for i in range(w+1,len(l)):
   if l[i]!=e[0]:
      t=t+1
   else:
      y.append(t)
      t=1
y.sort()
print(y[0])
