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())
a = map(int, raw_input().split(' '))
max_val = int(1e9 + 7)
min_val = a[0]
prev_min_index = 0
ans = max_val
for i in xrange(1, len(a)):
    if a[i] < min_val:
        min_val = a[i]
        ans = max_val
        prev_min_index = i
    elif a[i] == min_val:
        ans = min(ans, i - prev_min_index)
        prev_min_index = i
print(ans)