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() {
  vector<int> v;
  int n, mini = INT_MAX;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    if (t < mini) mini = t;
    v.push_back(t);
  }
  int j;
  for (j = 0; j < n; j++) {
    if (v[j] == mini) break;
  }
  int c = INT_MAX, st = j, t;
  for (int i = j + 1; i < n; i++) {
    if (v[i] == mini) {
      t = i - st;
      if (t < c) c = t;
      st = i;
    }
  }
  cout << c;
  return 0;
}
