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;
void run() {}
void fast() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
bool chk(string x) {
  int c = 0;
  for (int i = 0; i < int(x.size()) - 1; i++)
    if (x[i] != x[i + 1]) return 1;
  return 0;
}
int main() {
  fast();
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  int mn = *min_element((v).begin(), (v).end());
  bool flag = 0;
  int last = -1;
  int ans = 1e9;
  for (int i = 0; i < n; i++) {
    if (v[i] == mn && !flag) {
      flag = 1, last = i;
      continue;
    }
    if (flag && last != -1 && v[i] == mn) {
      ans = min(ans, i - last);
      last = i;
    }
  }
  cout << ans << endl;
  return 0;
}
