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
""" 616C """
""" 1152B """
import math
# import sys
def main():
	# n ,m= map(int,input().split())
	# arr = list(map(int,input().split()))
	# b = list(map(int,input().split()))
	# n = int(input())
	# string = str(input())
	n = int(input())
	a = list(map(int,input().split()))
	mn = min(a)
	arr = []
	for i in range(n):
		if(a[i]==mn):
			arr.append(i+1)
	ans = 1e10
	for i in range(1,len(arr)):
		ans = min(arr[i]-arr[i-1],ans)
	print(ans)
	return

main()
# def test():
# 	t = int(input())
# 	while t:
# 		main()
# 		t-=1
# test()