#include <bits/stdc++.h>
using namespace std;
inline void Input_Output() {}
const double eps = 0.000001;
const long double pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const long long MOD = 1e18 + 9;
const long long INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int n, m, k;
int cnt[N];
string s;
int a[N];
vector<int> g[N];
int u[N];
int ans, res;
int cur;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  unordered_map<int, int> was;
  int ans = 0;
  for (int l = 1; l <= n; ++l) {
    int r = n;
    for (; r >= l; --r) {
      if (was[a[r]] > 0) {
        break;
      }
      was[a[r]]++;
    }
    ans = max(ans, l - 1 + n - r);
    for (++r; r <= n; ++r) was[a[r]]--;
    if (was[a[l]] > 0) break;
    was[a[l]]++;
  }
  printf("%d", n - ans);
  return 0;
}
