#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
unordered_set<int> set;
int res=0;
int cur_cnt=0;
int r=0;
for(int l=0;l<n;l++){
while(r>l and !set.count(v[r])){
++cur_cnt;
set.insert(v[r]);
r++;
}
set.erase(v[l]);
res=max(cur_cnt,res);
}
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJY2luPj5uOwoJCgl2ZWN0b3I8aW50PnYobik7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PnZbaV07Cgl9Cgl1bm9yZGVyZWRfc2V0PGludD4gc2V0OwoJaW50IHJlcz0wOwoJaW50IGN1cl9jbnQ9MDsKCWludCByPTA7Cglmb3IoaW50IGw9MDtsPG47bCsrKXsKCQl3aGlsZShyPmwgYW5kICFzZXQuY291bnQodltyXSkpewoJCQkJKytjdXJfY250OwoJCQkJc2V0Lmluc2VydCh2W3JdKTsKCQkJCXIrKzsKCQkJCgkJfQoJCXNldC5lcmFzZSh2W2xdKTsKCQkKCQlyZXM9bWF4KGN1cl9jbnQscmVzKTsKCX0KCQoJCgkKfQ==