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的序列中，距离最短的最小值的距离。

The first line contains positive integer $ n $ ( $ 2

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