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;
void read(int &val) {
  int x = 0;
  int bz = 1;
  char c;
  for (c = getchar(); (c < '0' || c > '9') && c != '-'; c = getchar())
    ;
  if (c == '-') {
    bz = -1;
    c = getchar();
  }
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  val = x * bz;
}
const int INF = 0x3f3f3f3f;
const int maxn = 4e5 + 100;
const int mod = 1e9 + 7;
map<int, int> mp;
int n, a[maxn];
int main() {
  read(n);
  int mi = INF;
  for (int i = 1; i <= n; i++) read(a[i]), mi = min(mi, a[i]);
  int ans = INF;
  for (int i = 1; i <= n; i++) {
    if (a[i] != mi) continue;
    if (mp[a[i]]) ans = min(ans, i - mp[a[i]]);
    mp[a[i]] = i;
  }
  printf("%d\n", ans);
  return 0;
}
