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 maxn = 1e5 + 5;
int num[maxn], cpy[maxn];
int main() {
  int i, j, n, m;
  while (cin >> n) {
    for (i = 0; i < n; i++) cin >> num[i];
    memcpy(cpy, num, sizeof(num));
    sort(num, num + n);
    int ans = 0xfffffff;
    bool flag = false;
    int x = -1, y = -1;
    for (i = 0; i < n; i++) {
      if (cpy[i] == num[0]) {
        if (!flag) {
          flag = true;
          x = i;
        } else {
          y = i;
          if (y - x < ans) ans = y - x;
          x = y;
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}
