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>
int main() {
  int nn, miny, answer = 1e9, counter = 0;
  std::cin >> nn;
  std::vector<int> values(nn);
  std::cin >> values[0];
  miny = values[0];
  for (int ind = 1; ind < nn; ++ind) {
    std::cin >> values[ind];
    miny = std::min(miny, values[ind]);
  }
  bool flag = false;
  for (int ind = 0; ind < nn; ++ind) {
    if (values[ind] == miny && !flag) {
      flag = true;
    } else if (values[ind] == miny && flag) {
      ++counter;
      answer = std::min(answer, counter);
      counter = 0;
    } else if (flag) {
      ++counter;
    }
  }
  std::cout << answer;
  return 0;
}
