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 tinf = (int)1e9 + 7;
const long long inf = (long long)1e18 + 7;
const int N = 1e5 + 5;
long long log2(long long x) { return log10(x) / log10(2); }
int main() {
  {
    ios ::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
  }
  long long n;
  cin >> n;
  long long a[n], Min = inf;
  vector<long long> an;
  for (int i = 0; i < n; i++) cin >> a[i], Min = min(Min, a[i]);
  for (int i = 0; i < n; i++)
    if (a[i] == Min) an.push_back(i);
  long long ans = inf;
  for (int i = 1; i < an.size(); i++) ans = min(ans, an[i] - an[i - 1]);
  cout << ans;
}
