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>
const int mxn = 1e5 + 1;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
  int t = 1;
  while (t--) {
    int n;
    cin >> n;
    int A[n];
    int mn = INT_MAX;
    for (int i = 0; i < n; ++i) {
      cin >> A[i];
      mn = min(A[i], mn);
    }
    int ans = INT_MAX;
    int last = -1;
    for (int i = 0; i < n; ++i) {
      if (A[i] == mn) {
        if (last == -1)
          last = i;
        else {
          ans = min(i - last, ans);
          last = i;
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}
