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;
template <class T>
inline bool read(T &x) {
  int c = getchar();
  int sgn = 1;
  while (~c && c < '0' || c > '9') {
    if (c == '-') sgn = -1;
    c = getchar();
  }
  for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
  x *= sgn;
  return ~c;
}
const int INF = 2e9;
const int MX = 100005;
const int MOD = 1000000007;
const double PI = acos(-1.0);
int main() {
  int mn = INF;
  int n = ({
    int a;
    read(a);
    a;
  });
  int a[n];
  for (int i = 0; i < n; i++) {
    a[i] = ({
      int a;
      read(a);
      a;
    });
    if (a[i] < mn) mn = a[i];
  }
  int sr = 0;
  int st;
  while (true) {
    if (a[sr] == mn) {
      st = sr;
      break;
    }
    sr++;
  }
  int mindis = INF;
  for (int i = st + 1; i < n; i++) {
    if (a[i] == mn) {
      mindis = min(mindis, i - st);
      st = i;
    }
  }
  printf("%d\n", mindis);
  return 0;
}
