#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
map<int,int> Map;
int L=0;
int R=0;
int len=0;
while(R < n)
{
if(Map.count(a[R]) > 0)
{
L = max(L,Map[a[R]]+1);
}
Map[a[R]] = R;
//cout<<"L="<<L<<" R="<<R<<" R-L+1="<<R-L+1<<endl;
len = max(len,R-L+1);
R++;
}
cout<<len<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8bWFwPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgoJaW50IG47CgljaW4+Pm47CgkKCWludCBhW25dOwoJZm9yKGludCBpPTA7aTxuO2krKykKCXsKCQljaW4+PmFbaV07Cgl9CgoJbWFwPGludCxpbnQ+IE1hcDsKCWludCBMPTA7CglpbnQgUj0wOwoJCglpbnQgbGVuPTA7Cgl3aGlsZShSIDwgbikKCXsKCQlpZihNYXAuY291bnQoYVtSXSkgPiAwKQoJCXsKCQkJTCA9IG1heChMLE1hcFthW1JdXSsxKTsKCQl9CgkJCgkJTWFwW2FbUl1dID0gUjsKCQkvL2NvdXQ8PCJMPSI8PEw8PCIgUj0iPDxSPDwiIFItTCsxPSI8PFItTCsxPDxlbmRsOwoJCWxlbiA9IG1heChsZW4sUi1MKzEpOwoJCVIrKzsKCQkKCX0KCgljb3V0PDxsZW48PGVuZGw7CgoJcmV0dXJuIDA7Cn0=