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
#include <bits/stdc++.h>
using namespace std;
long long arr[1000000];
int main() {
  long long n, i;
  long long mini;
  scanf("%lld", &n);
  for (i = 0; i < n; i++) {
    scanf("%lld", &arr[i]);
    if (i == 0) {
      mini = arr[i];
    } else {
      mini = ((arr[i] >= mini) ? (mini) : (arr[i]));
    }
  }
  long long minidist;
  vector<long long> vec;
  for (i = 0; i < n; i++) {
    if (arr[i] == mini) {
      vec.push_back(i);
    }
  }
  sort(vec.begin(), vec.end());
  minidist = vec[1] - vec[0];
  for (i = 2; i < vec.size(); i++) {
    minidist = ((minidist >= (vec[i] - vec[i - 1])) ? ((vec[i] - vec[i - 1]))
                                                    : (minidist));
  }
  printf("%lld\n", minidist);
  return 0;
}
