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>
double EPS = 0.0000001;
const long long INF = 1000000007;
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  int mn = INF;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    mn = min(mn, a[i]);
  }
  vector<int> m;
  for (int i = 0; i < n; i++)
    if (a[i] == mn) m.push_back(i);
  int ans = INF;
  for (int i = 0; i < m.size() - 1; i++) ans = min(ans, m[i + 1] - m[i]);
  cout << ans;
  return 0;
}
