#include <bits/stdc++.h>
using namespace std;
void files() {
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  return;
}
double eps = 1e-6;
double pi = acos(-1);
const int MXN = 1e5 + 5;
const long long MOD = 1e9 + 7;
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {1, -1, 0, 0};
int dy4[] = {0, 0, 1, -1};
long long bin(long long base, long long pow, long long m) {
  base %= m;
  long long ans = 1;
  while (pow) {
    if (pow & 1) ans = ans * base % m;
    base = base * base % m;
    pow >>= 1;
  }
  return ans;
}
void sol() {
  int n;
  scanf("%d", &n);
  map<int, vector<int>> id;
  for (int i = 0; i < n; ++i) {
    int x;
    scanf("%d", &x);
    id[x].push_back(i);
  }
  int mn = n;
  for (auto v : id) {
    for (int i = 0; i + 1 < (int)v.second.size(); ++i) {
      mn = min(mn, v.second[i + 1] - v.second[i]);
    }
    break;
  }
  printf("%d\n", mn);
}
int main() {
  int tcase = 1;
  cout << fixed << setprecision(6);
  while (tcase--) {
    sol();
  }
}
