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 = raw_input()
arr = raw_input().split()
min = int(arr[0])

index = 0
for i in range(0, len(arr)):
    if (int(arr[i]) <= min):
        min = int(arr[i])
        index = i

ar=[]
for x in range(index,-1,-1):
    if(min == int(arr[x])):
        ar.append(x)

s=1
for y in range(0,len(ar)-1):
    m=ar[y]-ar[y+1]
    if(y==0):
        s=m
    elif(m<=s):
        s=m


print s
