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 PLAY() {
  cout << fixed << setprecision(10);
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
bool cmp(string &a, string &b) { return a.size() < b.size(); }
bool get(char c) {
  return (c == 'a' || c == 'o' || c == 'u' || c == 'i' || c == 'e' || c == 'y');
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<long long> x(n);
  long long mini = LONG_LONG_MAX;
  for (int i = 0; i < n; i++) {
    cin >> x[i];
    mini = min(mini, x[i]);
  }
  long long idx = -1;
  long long ans = LONG_LONG_MAX;
  for (int i = 0; i < n; i++) {
    if (x[i] == mini) {
      if (idx == -1) {
        idx = i;
        continue;
      }
      ans = min(ans, i - idx);
      idx = i;
    }
  }
  cout << ans << endl;
  return 0;
}
