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
# -*- coding: utf-8 -*-
"""
Created on Sun Dec 31 20:46:55 2017

@author: Administrator
"""

arr = [0] * 100010
def solve():
    n = int(raw_input())
    str = raw_input()
    str_split = str.split()
    for i in range(n):
        arr[i] = int(str_split[i])
        #print arr[i]
    minn = 1000000000000;
    for i in range(n):
        if arr[i] < minn:
            minn = arr[i]
    index = -10000000
    ans = 1000000000000;
    for i in range(n):
        if arr[i] == minn:
            if ans > i - index:
                ans = i - index
            index = i
    print ans
solve()
#str = raw_input()