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() {
  long long n, i, a, flag, ans, d, c, mm, arr[200005];
  while (scanf("%lld", &n) == 1) {
    ans = 1000000010;
    for (i = 0; i < n; i++) {
      scanf("%lld", &arr[i]);
      if (ans > arr[i]) {
        mm = arr[i];
        ans = arr[i];
      }
    }
    flag = 0;
    ans = 1000000010;
    for (i = 0; i < n; i++) {
      if (arr[i] == mm && flag == 0) {
        c = i;
        flag = 1;
        i++;
      }
      if (flag == 1 && mm == arr[i]) {
        a = i - c;
        if (ans > a) ans = a;
        c = i;
      }
    }
    if (n == 1)
      cout << "0" << endl;
    else
      cout << ans << endl;
  }
  return 0;
}
