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 minim(int val1, int val2) {
  if (val1 < val2) {
    return val1;
  }
  return val2;
}
int array1[100005];
int array2[100005];
int main() {
  int n;
  int mini = INT_MAX;
  int j = 0;
  int mini2 = INT_MAX;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> array1[i];
  }
  for (int i = 0; i < n; i++) {
    mini = minim(mini, array1[i]);
  }
  for (int i = 0; i < n; i++) {
    if (mini == array1[i]) {
      array2[j] = i;
      j++;
    }
  }
  for (int i = 0; i < j - 1; i++) {
    mini2 = minim(mini2, abs(array2[i] - array2[i + 1]));
  }
  cout << mini2 << endl;
  return 0;
}
