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;
  cin >> n;
  int j = 0;
  int arr[n];
  int arr1[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int min1 = arr[0];
  for (int i = 1; i < n; i++) {
    if (arr[i] < min1) {
      min1 = arr[i];
    }
  }
  for (int i = 0; i < n; i++) {
    if (arr[i] == min1) {
      arr1[j] = i;
      j++;
    }
  }
  int team = 0;
  int min2 = INT_MAX;
  for (int i = 0; i < j - 1; i++) {
    team = arr1[i + 1] - arr1[i];
    if (team < min2) {
      min2 = team;
    }
  }
  cout << min2;
}
