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

array = list(int(t) for t in input().rstrip().split(" "))

mini=min(array)
min_old_position=0
min_new_position=0
min_distance=len(array)
start = True
for i in range(len(array)):
	if array[i]==mini:
		if start:
			start = False
			min_old_position=i
			continue
		else:
			min_new_position=i

			if abs(min_new_position-min_old_position)<min_distance: min_distance = abs(min_new_position-min_old_position)
			min_old_position=min_new_position

print(min_distance)