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 int n;
  long int a;
  long int min = 2000000000;
  scanf("%ld", &n);
  long int flag = -1, diff = 2000000000;
  int ivec[n];
  for (int i = 0; i < n; i++) {
    scanf("%ld", &a);
    ivec[i] = a;
    if (min > a) min = a;
  }
  for (int i = 0; i < n; i++) {
    if (min == ivec[i] && flag == -1) {
      flag = i;
    } else {
      if (min == ivec[i]) {
        int coun = i - flag;
        flag = i;
        if (coun < diff) {
          diff = coun;
        }
      }
    }
  }
  cout << diff;
  return 0;
}
