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())
str1=input()

list1=str1.split()

list1=[int(item) for item in list1]

min1=min(list1)
#print(min1)
list2=[]
list3=[]
for i in range(len(list1)):
    if list1[i]==min1:
        list2.append(i)
#print(list2)

for i in range(len(list2)-1):
    list3.append(list2[i+1]-list2[i])
#print(list3)    
c=min(list3)



print(c)