#include <bits/stdc++.h>
using namespace std;
void print(vector<int> &arr){
int n = arr.size();
for(int i = 0; i < n; i++){
cout << arr[i] << " ";
}
}
int main() {
int n; cin >> n;
vector<int> arr(n);
for(int i = 0; i < n; i++)
cin >> arr[i];
vector<int> pref(n+1);
pref[0] = 0;
for(int i = 1; i <= n; i++){
pref[i] = pref[i-1]+arr[i-1];
}
unordered_map<int,int> mp;
int res = INT_MIN;
int curr_sum = 0;
for(int i = 0; i < n; i++){
curr_sum += arr[i];
if(mp.find(arr[i]) != mp.end()){
int sum = curr_sum - mp[arr[i]];
res = max(sum, res);
mp[arr[i]] = min(mp[arr[i]], pref[i]);
}
else
mp[arr[i]] = pref[i];
}
cout << res;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIHByaW50KHZlY3RvcjxpbnQ+ICZhcnIpewoJaW50IG4gPSBhcnIuc2l6ZSgpOwoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJY291dCA8PCBhcnJbaV0gPDwgIiAiOwoJfQp9CmludCBtYWluKCkgewoJaW50IG47IGNpbiA+PiBuOwoJdmVjdG9yPGludD4gYXJyKG4pOwoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKykKCWNpbiA+PiBhcnJbaV07CgkKCXZlY3RvcjxpbnQ+IHByZWYobisxKTsKCXByZWZbMF0gPSAwOwoJZm9yKGludCBpID0gMTsgaSA8PSBuOyBpKyspewoJCXByZWZbaV0gPSBwcmVmW2ktMV0rYXJyW2ktMV07Cgl9Cgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+IG1wOwoJCglpbnQgcmVzID0gSU5UX01JTjsKCWludCBjdXJyX3N1bSA9IDA7Cglmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKXsKCQljdXJyX3N1bSArPSBhcnJbaV07CgkJaWYobXAuZmluZChhcnJbaV0pICE9IG1wLmVuZCgpKXsKCQkJaW50IHN1bSA9IGN1cnJfc3VtIC0gbXBbYXJyW2ldXTsKCQkJcmVzID0gbWF4KHN1bSwgcmVzKTsKCQkJbXBbYXJyW2ldXSA9IG1pbihtcFthcnJbaV1dLCBwcmVmW2ldKTsKCQl9CgkJZWxzZQoJCW1wW2FycltpXV0gPSBwcmVmW2ldOwoJfQoJY291dCA8PCByZXM7CglyZXR1cm4gMDsKfQ==