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;
static long long int l, x, y, n, m, s, q, i, z, p, j = 1, k, c, d, t;
string s1, s2, s3;
long long int a[1000001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  long long int ma;
  ma = a[0];
  vector<int> v;
  ma = *min_element(a, a + n);
  for (int i = 0; i < n; i++) {
    if (a[i] == ma) {
      v.push_back(i);
    }
  }
  long long int best = 1000000007;
  for (int i = 0; i < v.size() - 1; i++) {
    k = v[i + 1] - v[i];
    best = min(best, k);
  }
  cout << best;
}
