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 main() {
  long int b;
  cin >> b;
  long long int a[b];
  for (int i = 0; i < b; i++) {
    cin >> a[i];
  }
  long long int min = a[0];
  for (int i = 0; i < b; i++) {
    if (min > a[i]) min = a[i];
  }
  long int c = -1;
  long int d = -1;
  int e = 0;
  long int f = b;
  for (int i = 0; i < b; i++) {
    if (a[i] == min) {
      if (e == 0) {
        c = i;
        e += 1;
      } else if (e == 1) {
        d = i;
        e = 0;
      }
      if ((d != -1) && (f > abs(d - c))) {
        f = abs(d - c);
      }
    }
  }
  cout << f;
  return 0;
}
