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())
l1=[]
l1=input().split()
i=0
for i in range(n):
    l1[i]=int(l1[i])
l2=[]
l2=l1[:]
l2.sort()
j=0
for j in range(n-1):
    if(l2[j]==l2[j+1]):
        x=l2[j]
        break
st=-1
en=-1
c=0
d=-1
for c in range(n):
    if(l1[c]==x):
        if(st==-1):
            st=c
        else:
            if(en!=-1):
                st=en
            en=c
            if(d==-1):
                d=en-st
            else:
                if((en-st)<d):
                    d=en-st
print(d)