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;
  vector<int> arr(n);
  for (int i = 0; i < n; i++) cin >> arr[i];
  int minValue = 1987654321;
  int minIndex = 0;
  for (int i = 0; i < n; i++) {
    if (minValue > arr[i]) {
      minValue = arr[i];
      minIndex = i;
    }
  }
  int sol = 1987654321;
  int count = 0;
  for (int i = minIndex + 1; i < n; i++) {
    count++;
    if (minValue == arr[i]) {
      sol = min(sol, count);
      count = 0;
    }
  }
  cout << sol << endl;
  return 0;
}
