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 = input()
arr = map(int, raw_input().split())
min_ele = arr[0]
indexes = [0]
for i in xrange(1,n):
    if arr[i] == min_ele:
        indexes.append(i)
    elif arr[i] < min_ele:
        min_ele = arr[i]
        indexes = [i]
min_dist = indexes[1]-indexes[0]
l = len(indexes)
for i in xrange(2,l):
    min_dist = min(min_dist, indexes[i]-indexes[i-1])
print min_dist