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() {
  int n, i, min, mindist, trig, dist, trig2;
  trig = 0;
  trig2 = 0;
  cin >> n;
  int array[n];
  for (i = 0; i < n; i++) {
    cin >> array[i];
    if (i == 0) {
      min = array[i];
    } else {
      if (array[i] < min) {
        min = array[i];
      }
    }
  }
  for (i = 0; i < n; i++) {
    if (array[i] == min) {
      if (trig == 0) {
        dist = 0;
        trig = 1;
      } else {
        if (trig2 == 0) {
          mindist = dist;
          trig2 = 1;
        } else {
          if (dist < mindist) {
            mindist = dist;
          }
        }
        dist = 0;
      }
    }
    if (trig == 1) {
      dist = dist + 1;
    }
  }
  cout << mindist;
  return 0;
}
