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().split()

lind = []
min_l = int(l[0])

min_ind = n

for i in range(n):
    l[i] = int(l[i])

    if l[i] < min_l:
        min_l = l[i]

for i in range(n):
    if l[i] == min_l:
        lind.append(i)

for i in range(1, len(lind)):
    if lind[i] - lind[i - 1] < min_ind:
        min_ind = lind[i] - lind[i - 1]

print(min_ind)

