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;
void READ() {
  std::ios::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
}
const int N = 5 + 1e5;
struct Point {
  int x, y;
  Point(int x = 0, int y = 0) : x(x), y(y) {}
  bool operator<(const Point& P) const {
    return x < P.x || (x == P.x && y < P.y);
  }
} a[N];
int n;
int main() {
  READ();
  cin >> n;
  int mi = 0x3f3f3f3f, t;
  for (int i = 0; i < n; i++) {
    cin >> t;
    a[i] = Point(t, i);
  }
  sort(a, a + n);
  for (int i = 1; i < n; i++) {
    if (a[i].x != a[0].x) break;
    mi = min(mi, a[i].y - a[i - 1].y);
  }
  cout << mi;
  return 0;
}
