CF911A.Nearest Minimums

You are given an array of n integer numbers _a_0, _a_1, ..., a__n - 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.

给你一个包含 $n$ 个整数的数组 $a_0, a_1, ..., a_{n-1}$。请找出其中两个最接近（即距离最近）的最小值之间的距离。题目保证数组中最小值至少出现两次。

The first line contains positive integer n (2 ≤ n ≤ 105) — size of the given array. The second line contains n integers _a_0, _a_1, ..., a__n - 1 (1 ≤ a__i ≤ 109) — elements of the array. It is guaranteed that in the array a minimum occurs at least two times.

第一行包含一个正整数 $n$（$2 \leq n \leq 10^5$）—— 给定数组的大小。
第二行包含 $n$ 个整数 $a_0, a_1, ..., a_{n-1}$（$1 \leq a_i \leq 10^9$）—— 数组的元素。
保证数组中最小值至少出现两次。

Print the only number — distance between two nearest minimums in the array.

输出唯一的一个数——数组中两个最近的最小值之间的距离。