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())
array = [i for i in map(int, input().split())]
#print(array)

min_num = array[0]
d = dict()

for i in range(n):
    num = array[i]
    if num not in d:
        d[num] = []
        d[num].append(i)
    else:
        d[num].append(i)

#Find minimum num: 
for key in d.keys():
    if key < min_num and len(d[key]) >= 2: 
        min_num = key

#Find min distance
pos_min = d[min_num]
result = pos_min[1] - pos_min[0]
for i in range(len(pos_min) - 1): 
    result = min(result, pos_min[i+1] - pos_min[i])
    
print(result)