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())
lst = list(map(int,input().split()))
mn = min(lst)
i1 = 0
i2 = 0
flag = True
answer = float("inf")
for i in range(n):
    if flag and lst[i] == mn :
        i1 = i
        k = 0
        flag = False
    elif lst[i] == mn and k % 2 == 0:
        i2 = i
        k += 1
        if i2-i1 < answer:
            answer = i2-i1
    elif lst[i] == mn and k%2 == 1:
        i1 = i
        k += 1
        if i1-i2 < answer:
            answer = i1-i2
print(answer)
