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(raw_input(''))
tab = map(int, raw_input('').split(' '))
mini = 999999999999
poz = -1
poz2 = -1
poz3 = 999999999999
tab_poz = []
for x in range(0, len(tab), +1):
    if tab[x] < mini:
        mini = tab[x]
for x in range(0, len(tab), +1):
    if tab[x] == mini:
        tab_poz.append(x)
for x in range(1, len(tab_poz), +1):
    poz2 = tab_poz[x] - tab_poz[x-1]
    if poz2 < poz3:
        poz3 = poz2
print poz3