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() {
  long long n;
  long long arr[100010];
  map<long long, long long> m;
  map<long long, long long> k;
  scanf("%lld", &n);
  long long me = LONG_LONG_MAX;
  for (int i = 0; i < n; i++) {
    scanf("%lld", &arr[i]);
    me = min(me, arr[i]);
  }
  long long cnt = 0, fpos, ans, mi = LONG_LONG_MAX;
  for (int i = 0; i < n; i++) {
    if (arr[i] == me && cnt != 1) {
      cnt = 1;
      fpos = i;
    } else if (arr[i] == me && cnt == 1) {
      ans = i - fpos;
      fpos = i;
      mi = min(ans, mi);
    }
  }
  cout << mi << endl;
  return 0;
}
