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>
int dif[1000000];
int temp[1000000];
int arr[1000000];
int main() {
  int n;
  scanf("%d", &n);
  int min;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &arr[i]);
  }
  min = arr[0];
  for (int i = 1; i < n; ++i) {
    if (min > arr[i]) {
      min = arr[i];
    }
  }
  int mindex = 0;
  int count = 0;
  int j = 0;
  for (int i = 0; i < n; ++i) {
    if (arr[i] == min) {
      temp[j] = i;
      j++;
    }
  }
  for (int i = 0; i < j - 1; ++i) {
    dif[i] = temp[i + 1] - temp[i];
  }
  int a = dif[0];
  for (int i = 0; i < j - 1; ++i) {
    if (a > dif[i]) {
      a = dif[i];
    }
  }
  printf("%d\n", a);
}
