Nearest Minimums

Description:

Input:

The first line contains positive integer n (2 ≤ n ≤ 10⁵) — size of the given array. The second line contains n integers a₀, a₁, ..., a_n - 1 (1 ≤ a_i ≤ 10⁹) — 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.

Sample Input:

2
3 3

Sample Output:

1

Sample Input:

3
5 6 5

Sample Output:

2

Sample Input:

9
2 1 3 5 4 1 2 3 1

Sample Output:

3