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())
a = [int(s) for s in input().split()]
m = min(a)
b = []
for i in range(0, n):
    if a[i] == m:
        b.append(i)
mm = n + 1
if len(b) == 1:
    mm = 0
    for i in range(1, n):
        if a[i] == m:
            mm = i
            break
    nm = 0
    if(mm == 0):
        nm = 1
    for i in range(0, n):
        if a[i] != m and (a[i] < a[nm] or a[i] == a[nm] and abs(mm - i) < abs(nm - i)):
            nm = i
    print(mm - nm)
else:
    for i in range(1, len(b)):
        if b[i] - b[i-1] < mm:
            mm = b[i] - b[i-1]
    print(mm)