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;
int main() {
  ios_base::sync_with_stdio(false);
  long long int t, n, m, x, y, p, q, i, j, k, answer = 0;
  cin >> n;
  vector<long long int> a(n);
  for (i = 0; i < n; i++) cin >> a[i];
  x = *min_element(a.begin(), a.end());
  vector<long long int> ref;
  for (i = 0; i < n; i++)
    if (a[i] == x) ref.push_back(i);
  answer = LLONG_MAX;
  for (i = 1; i < ref.size(); i++) answer = min(answer, ref[i] - ref[i - 1]);
  cout << answer;
}
