#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  long min = 1000000003;
  for (int i = 0; i < n; i++) {
    if (a[i] < min) min = a[i];
  }
  int last = -1;
  int curr = -1;
  int minDist = 100005;
  for (int i = 0; i < n; i++) {
    if (a[i] == min) {
      last = curr;
      curr = i;
      if (last >= 0 && curr >= 0 && (curr - last < minDist)) {
        minDist = curr - last;
      }
    }
  }
  cout << minDist;
  return 0;
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  long min = 1000000003;
  for (int i = 0; i < n; i++) {
    if (a[i] < min) min = a[i];
  }
  int last = -1;
  int curr = -1;
  int minDist = 100005;
  for (int i = 0; i < n; i++) {
    if (a[i] == min) {
      last = curr;
      curr = i;
      if (last >= 0 && curr >= 0 && (curr - last < minDist)) {
        minDist = curr - last;
      }
    }
  }
  cout << minDist;
  return 0;
}

```