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;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie();
  bool b = false;
  long long mini = 1e10, e;
  int n;
  cin >> n;
  vector<long long> vec(n), vec1;
  for (int i = 0; i < n; i++) {
    cin >> vec[i];
    if (vec[i] < mini) {
      mini = vec[i];
    }
  }
  for (int i = 0; i < n; i++) {
    if (vec[i] == mini) {
      if (!b) {
        b = true;
        e = i;
        continue;
      } else {
        vec1.push_back(abs(e - i));
        e = i;
      }
    }
  }
  sort(vec1.begin(), vec1.end());
  cout << vec1[0];
  return 0;
}
