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() {
  vector<int> vct, vct1;
  int q, a;
  cin >> q;
  while (q--) {
    cin >> a;
    vct.push_back(a);
  }
  vector<int>::iterator it = min_element(vct.begin(), vct.end());
  for (int i = 0; i < vct.size(); i++)
    if (*it == vct[i]) vct1.push_back(i);
  sort(vct1.begin(), vct1.end());
  if (vct1.size() > 1) {
    int s = vct1[1] - vct1[0];
    for (int i = 1; i < vct1.size() - 1; i++)
      if ((vct1[i + 1] - vct1[i]) < s) s = (vct1[i + 1] - vct1[i]);
    cout << s << endl;
  } else
    cout << "0" << endl;
}
