#include <cstdio>
#include <set>
#include <map>
using namespace std;

const int M = 1e6 + 100;
int a[M];

int main() {
    int n; scanf("%d", &n);
    set<int> st;
    for (int i = 0; i < n; i++) scanf("%d", &a[i]), st.insert(a[i]);
    map<int, int> mp;
    int res = n + 1; 
    for (int l = 0, r = 0, num = 0, tot_num = st.size();;) {
        while (r < n and num < tot_num)
            if (mp[a[r++]]++ == 0) ++num;
        if (num < tot_num) break;
        res = min(res, r - l);
        if (--mp[a[l++]] == 0) --num;
    }
    printf("%d\n", res);
}