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 arr[100001];
  int n, j, k, minimum, minimum_1, distance;
  while (scanf("%d", &n) != EOF) {
    j = 0;
    k = 0;
    distance = 0;
    minimum_1 = 0;
    for (int i = 0; i < n; i++) {
      scanf("%d", &arr[i]);
      if (i == 0) {
        k = i;
        minimum = arr[0];
      } else if (minimum > arr[i]) {
        k = i;
        minimum = arr[i];
      }
    }
    for (int i = (k + 1); i < n; i++) {
      if (minimum == arr[i]) {
        if (minimum_1 == 0) {
          minimum_1 = (i - k);
          distance = minimum_1;
          j = i;
        } else {
          minimum_1 = (i - j);
          if (minimum_1 < distance) {
            distance = minimum_1;
          }
          j = i;
        }
      }
    }
    printf("%d\n", distance);
  }
  return 0;
}
