#include<bits/stdc++.h>
#define f1(i, n) for(ll i=1;i<=n;++i)
#define f0(i, n) for(ll i=0;i<n;++i)
#define ull unsigned long long
#define ll long long
#define rev(a) reverse(a.begin(),a.end())
#define all(x) x.begin(),x.end()
#define so(A, n) sort(A+1, A+n+1)
using namespace std;
const int maxn = 200010;
const int N = 5e6;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
map<int, vector<int>> v;
int T[n + 1] = {}, A[n + 1], mi = INT_MAX, ma = INT_MIN;
f1(i, n) {
cin >> A[i];
T[i] = T[i - 1] + A[i];
v[A[i]].push_back(i);
mi = min(mi, A[i]);
ma = max(ma, A[i]);
}
int res = 0;
for (int i = mi; i <= ma; ++i) {
for (int j = 0; j < v[i].size(); ++j) {
for (int k = j; k < v[i].size(); ++k) {
res = max(res, T[v[i][k]] - T[v[i][j] - 1]);
}
}
}
cout << res;
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBmMShpLCBuKSBmb3IobGwgaT0xO2k8PW47KytpKQojZGVmaW5lIGYwKGksIG4pIGZvcihsbCBpPTA7aTxuOysraSkKI2RlZmluZSB1bGwgdW5zaWduZWQgbG9uZyBsb25nCiNkZWZpbmUgbGwgbG9uZyBsb25nCiNkZWZpbmUgcmV2KGEpIHJldmVyc2UoYS5iZWdpbigpLGEuZW5kKCkpCiNkZWZpbmUgYWxsKHgpIHguYmVnaW4oKSx4LmVuZCgpCiNkZWZpbmUgc28oQSwgbikgc29ydChBKzEsIEErbisxKQp1c2luZyBuYW1lc3BhY2Ugc3RkOwpjb25zdCBpbnQgbWF4biA9IDIwMDAxMDsKY29uc3QgaW50IE4gPSA1ZTY7CgppbnQgbWFpbigpCnsKCWlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7IGNpbi50aWUoMCk7IGNvdXQudGllKDApOwoJaW50IG47CgljaW4gPj4gbjsKCW1hcDxpbnQsIHZlY3RvcjxpbnQ+PiB2OwoJaW50IFRbbiArIDFdID0ge30sIEFbbiArIDFdLCBtaSA9IElOVF9NQVgsIG1hID0gSU5UX01JTjsKCWYxKGksIG4pIHsKCQljaW4gPj4gQVtpXTsKCQlUW2ldID0gVFtpIC0gMV0gKyBBW2ldOwoJCXZbQVtpXV0ucHVzaF9iYWNrKGkpOwoJCW1pID0gbWluKG1pLCBBW2ldKTsJCgkJbWEgPSBtYXgobWEsIEFbaV0pOwoJfQoJaW50IHJlcyA9IDA7Cglmb3IgKGludCBpID0gbWk7IGkgPD0gbWE7ICsraSkgewoJCWZvciAoaW50IGogPSAwOyBqIDwgdltpXS5zaXplKCk7ICsraikgewoJCQlmb3IgKGludCBrID0gajsgayA8IHZbaV0uc2l6ZSgpOyArK2spIHsKCQkJCXJlcyA9IG1heChyZXMsIFRbdltpXVtrXV0gLSBUW3ZbaV1bal0gLSAxXSk7CgkJCX0KCQl9Cgl9Cgljb3V0IDw8IHJlczsKCgoKCXJldHVybiAwOwp9Cgo=