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;
long long n, counter1 = 0;
int main() {
  cin >> n;
  long long arr[n], arr1[n], min_dis = INT_MAX, counter = 0, u, mine = INT_MAX;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    if (mine > arr[i]) {
      mine = arr[i];
      u = i;
    }
  }
  for (int i = u; i < n; i++) {
    if (mine == arr[i]) {
      arr1[counter] = i;
      counter++;
    }
  }
  for (int i = 0; i < counter - 1; i++) {
    if ((arr1[i + 1] - arr1[i]) < min_dis) {
      min_dis = arr1[i + 1] - arr1[i];
    }
  }
  cout << min_dis;
  return 0;
}
