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 maxn = 100000 + 10;
int a[maxn];
vector<int> vec;
int main() {
  int n;
  scanf("%d", &n);
  int minv = INT_MAX;
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
    minv = min(minv, a[i]);
  }
  for (int i = 1; i <= n; i++) {
    if (a[i] == minv) {
      vec.push_back(i);
    }
  }
  int ans = INT_MAX;
  for (int i = 1; i < vec.size(); i++) {
    ans = min(vec[i] - vec[i - 1], ans);
  }
  printf("%d\n", ans);
  getchar();
  getchar();
  return 0;
}
