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())

m = []
sv = -1
indexs = {}
s = list(map(int, input().split()))

for i in range(n):
    a = s[i]
    if sv == -1 or a < sv:
        sv = a
    m.append(a)
    if a not in indexs:
        indexs[a] = [i]
    else: indexs[a].append(i)

it = indexs[sv]
min_dist = it[1] - it[0]

for i in range(len(it)-1):
    if it[i+1] - it[i] < min_dist:
        min_dist = it[i+1] - it[i]

print(min_dist)