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;
vector<long long> parse(string &s) {
  vector<long long> input;
  long long n = s.length();
  long long i = 0;
  while (i < n) {
    string num = "";
    while (i < n && s[i] >= '0' && s[i] <= '9') {
      num += to_string(s[i]);
      i++;
    }
    if (num.size() != 0) input.push_back(stoll(num));
    i++;
  }
  return input;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long min_dif = LLONG_MAX;
  long long min_el = LLONG_MAX;
  for (long long i = 0; i < n; i++) min_el = min(min_el, a[i]);
  long long last_found = -1;
  for (long long i = 0; i < n; i++) {
    if (last_found == -1 && min_el == a[i]) {
      last_found = i;
    } else if (min_el == a[i]) {
      min_dif = min(i - last_found, min_dif);
      last_found = i;
    }
  }
  cout << min_dif << '\n';
  return 0;
}
