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;
const int INF = 0x3f3f3f3f;
const long long ll_INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e5 + 10;
const long long mod = 1e9 + 7;
int a[N];
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  int n, minn = INF;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] < minn) minn = a[i];
  }
  int cnt = 0, l = 0, r = n - 1, mc = INF, pre;
  while (a[l] != minn) l++;
  while (a[r] != minn) r--;
  for (int i = l + 1; i <= r; i++) {
    if (a[i] != minn)
      cnt++;
    else if (a[i] == minn) {
      if (mc > cnt + 1) {
        mc = cnt + 1;
      }
      cnt = 0;
    }
  }
  cout << mc << endl;
}
