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
from math import *
from bisect import *
from collections import Counter,defaultdict,deque
from sys import stdin, stdout
input = stdin.readline
I=lambda:int(input())
M =lambda:map(int,input().split())
LI=lambda:list(map(int,input().split()))
for _ in range(1):
  n=I()
  a=LI()
  b=min(a)
  c=-1;d=-1;ans=n
  for i in range(n):
    if c==-1 and b==a[i]:
      c=i
    elif d==-1 and b==a[i]:
      d=i
    elif b==a[i]:
      c=d;d=i
    if c>-1 and d>-1:
      ans=min(ans,d-c)
  print(ans)
























        
        
            


        



    









    

            







        
