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 = input()
l = [int(i) for i in l.split()]

x = min(l)
t = 0
ans =  0
r = 0
for i in range(len(l)):
    if l[i]==x and t==0:
        r = i
        t = 1
    elif l[i]==x and t==1:
        if ans ==0 :
            ans  = i- r
        else:
            ans = min(i - r , ans)
        r=i
        
        


print(ans)








          
                 
