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() {
  int n, ans = 10000000, tk, mn, start, fnish;
  bool flag = false;
  scanf("%d", &n);
  vector<int> vc;
  priority_queue<int> pq;
  priority_queue<int> res;
  for (int i = 0; i < n; i++) {
    scanf("%d", &tk);
    vc.push_back(tk);
    pq.push(tk * -1);
  }
  mn = pq.top() * -1;
  for (int i = 0; i < n; i++) {
    if (mn == vc[i] && !flag) {
      start = i + 1;
      flag = true;
    } else if (mn == vc[i] && flag) {
      fnish = i + 1;
      if (ans > fnish - start) ans = fnish - start;
      res.push(ans * -1);
      start = fnish;
    }
  }
  ans = res.top() * -1;
  printf("%d", ans);
}
