A. Nearest Minimumstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou 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.InputThe 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.OutputPrint the only number — distance between two nearest minimums in the array.ExamplesInput23 3Output1Input35 6 5Output2Input92 1 3 5 4 1 2 3 1Output3
Input23 3
Output1
['implementation', '*1100']