#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n;
cin>>n;
vector<int>arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
int maxi=0;
for(int i=0;i<n;i++){
unordered_map<int,int>mp;
for(int j=i;j<n;j++){
if(mp.find(arr[j])==mp.end()){
mp[arr[j]]++;
int len=j-i+1;
maxi=max(maxi,len);
}
else{
break;
}
}
}
cout<<"The maximum sum is:"<<maxi;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgbjsKCWNpbj4+bjsKCXZlY3RvcjxpbnQ+YXJyKG4pOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJY2luPj5hcnJbaV07Cgl9CglpbnQgbWF4aT0wOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJdW5vcmRlcmVkX21hcDxpbnQsaW50Pm1wOwoJCWZvcihpbnQgaj1pO2o8bjtqKyspewoJCQlpZihtcC5maW5kKGFycltqXSk9PW1wLmVuZCgpKXsKCQkJCW1wW2FycltqXV0rKzsKCQkJCWludCBsZW49ai1pKzE7CgkJCQltYXhpPW1heChtYXhpLGxlbik7CgkJCX0KCQkJZWxzZXsKCQkJCWJyZWFrOwoJCQl9CgkJfQoJfQoJY291dDw8IlRoZSBtYXhpbXVtIHN1bSBpczoiPDxtYXhpOwoJcmV0dXJuIDA7Cn0=