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>
const int maxx = 1e5;
using namespace std;
struct node {
  int x, y;
};
bool cmp(int a, int b) { return a > b; }
bool isprime(int n) {
  int i;
  if (n & 1 == 0) return false;
  for (i = 3; i * i <= n; i += 2) {
    if (n % i == 0) return false;
  }
  return true;
}
int main() {
  int n;
  cin >> n;
  int ara[n], i, j, mini = INT_MAX;
  for (i = 0; i < n; i++) {
    cin >> ara[i];
    mini = min(mini, ara[i]);
  }
  vector<int> v;
  int st = -1, endd = -1;
  for (i = 0; i < n; i++) {
    if (ara[i] == mini) {
      if (st == -1) st = i;
      endd = i;
    }
    if (st != -1 && endd != -1 && st != endd) {
      v.push_back(endd - st);
      st = endd;
      endd = -1;
    }
  }
  int minii = INT_MAX;
  for (auto lol : v) {
    minii = min(lol, minii);
  }
  cout << minii << '\n';
  return 0;
}
