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;
const int maxn = 1e5;
vector<pair<int, int> > V;
bool cmp(const pair<int, int> &A, const pair<int, int> &B) {
  if (A.first == B.first) return A.second < B.second;
  return A.first < B.first;
}
int main() {
  int n, x, ans = 0;
  pair<int, int> same;
  while (cin >> n) {
    for (int i = 0; i < n; i++) {
      cin >> x;
      V.push_back(pair<int, int>(x, i));
    }
    sort(V.begin(), V.end(), cmp);
    same = V[0];
    ans = 1e9;
    for (int i = 1; i < n; i++) {
      if (same.first != V[i].first) break;
      ans = min(ans, V[i].second - same.second);
      same = V[i];
    }
    cout << ans << endl;
  }
  return 0;
}
