#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long ll_INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e5 + 10;
const long long mod = 1e9 + 7;
int a[N];
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  int n, minn = INF;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] < minn) minn = a[i];
  }
  int cnt = 0, l = 0, r = n - 1, mc = INF, pre;
  while (a[l] != minn) l++;
  while (a[r] != minn) r--;
  for (int i = l + 1; i <= r; i++) {
    if (a[i] != minn)
      cnt++;
    else if (a[i] == minn) {
      if (mc > cnt + 1) {
        mc = cnt + 1;
      }
      cnt = 0;
    }
  }
  cout << mc << endl;
}
