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 N = 1e5 + 5;
const double PI = acos(-1.0);
const int maxn = 1e9 + 5;
int a[N];
int b[N];
int c[N];
using namespace std;
bool cmp(int a, int b) { return a > b; }
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
int main() {
  int n, temp = 0, minnum, temp1 = 0, minn;
  minnum = minn = maxn;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (minnum > a[i]) {
      minnum = a[i];
    }
  }
  for (int i = 0; i < n; i++) {
    if (minnum == a[i]) {
      b[temp++] = i;
    }
  }
  for (int i = 0; i < temp - 1; i++) {
    temp1 = b[i + 1] - b[i];
    if (minn > temp1) minn = temp1;
  }
  printf("%d", minn);
  return 0;
}
