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())
s = input().split()
a = []
limit = 10 ** 9 + 1
m = limit
for i in range(n):
    t = int(s[i])
    m = min(m, t)
    a.append(t)
first = -1
second = -1
ans = limit
for i in range(n):
    if a[i] == m:
        if first == -1:
            first = i
        else:
            second = i
            ans = min(ans, second - first)
            first = second
            second = -1
print(ans)