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 INF = 0x3f3f3f3f;
const int maxn = (int)3e5;
int n;
struct node {
  int num, id;
  bool operator<(const node& i) const {
    if (num == i.num) return id < i.id;
    return num < i.num;
  }
} a[maxn];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int temp;
    cin >> temp;
    a[i].id = i;
    a[i].num = temp;
  }
  sort(a + 1, a + n + 1);
  int ans = INF;
  if (a[1].num == a[2].num) {
    for (int i = 2; i <= n; i++) {
      if (a[i].num != a[1].num)
        break;
      else
        ans = min(ans, abs(a[i].id - a[i - 1].id));
    }
  } else {
    for (int i = 2; i <= n; i++) {
      if (a[i].num != a[2].num)
        break;
      else
        ans = min(ans, abs(a[i].id - a[1].id));
    }
  }
  cout << ans << endl;
  return 0;
}
