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 vals[100020];
int main() {
  long long min = 1000000001, tmp;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> tmp;
    if (min > tmp) min = tmp;
    vals[i] = tmp;
  }
  int index = -1;
  int closest = 10000000;
  for (int i = 0; i < n; i++) {
    if (vals[i] == min) {
      if (index == -1) {
        index = i;
      } else {
        if (closest > (i - index)) {
          closest = i - index;
        }
        index = i;
      }
    }
  }
  cout << closest << endl;
}
