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 n;
int main() {
  cin >> n;
  vector<int> v(n + 9);
  int mn = INT_MAX;
  for (int i = 0; i < (n); i++) {
    int x;
    cin >> x;
    v[i] = x;
    ;
    mn = min(mn, x);
  }
  int lI = 0;
  bool f = 1;
  int ans = 1000000009;
  for (int i = 0; i < (n); i++) {
    if (v[i] == mn) {
      if (f) {
        lI = i;
        f = 0;
      } else {
        ans = min(ans, i - lI);
        lI = i;
      }
    }
  }
  cout << ans;
  return 0;
}
