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=input()
l=map(int,raw_input().split())
min1=l[0]
min2=l[1]

for i in range(2,n):
    if l[i]<min1:
        min1=l[i]
    elif l[i]<min2:
        min2=l[i]
l1=[]
l2=[]

if min1==min2:
    l3=[]
    for i in range(n):
        if l[i]==min1:
            l3.append(i)
    l5=[]
    for i in range(1,len(l3)):
        l5.append(l3[i]-l3[i-1])
    print min(l5)
else:
    for i in range(n):
        if l[i]==min1:
            l3.append(i)
        elif l[i]==min2:
            l3.append(i)
    l4=[]
    min=10000000000
    for i in range(len(l3)):
        for j in range(len(l4)):
            if abs(l3[i]-l4[j])<min:
                min = abs(l3[i]-l4[j])
    print min
