#include <bits/stdc++.h>
using namespace std;
using ll =long long;
//In the name of Lord RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM RAM
ll digitSum(ll n){
ll sum=0;
while(n>0){
sum=sum+n%10;
n=n/10;
}
return sum;
}
int main() {
// your code goes here
ll n;
cin>>n;
vector<ll>arr(n);
for(ll i=0;i<n;i++) cin>>arr[i];
ll ans=-1;
unordered_map<ll,ll>mp;
for(ll i=0;i<n;i++){
ll x=digitSum(arr[i]);
if(mp.count(x)){
ll curr=arr[i]+mp[x];
ans=max(ans,curr);
mp[x]=max(mp[x],arr[i]);
}
else mp[x]=arr[i];
}
cout <<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp1c2luZyBsbCA9bG9uZyBsb25nOyAgICAKLy9JbiB0aGUgbmFtZSBvZiBMb3JkIFJBTSBSQU0gUkFNIFJBTSBSQU0gUkFNIFJBTSBSQU0gUkFNIFJBTSBSQU0gUkFNIFJBTSBSQU0gUkFNIFJBTSBSQU0gUkFNIFJBTSBSQU0gUkFNIFJBTQpsbCBkaWdpdFN1bShsbCBuKXsKCWxsIHN1bT0wOwoJd2hpbGUobj4wKXsKCQlzdW09c3VtK24lMTA7CgkJbj1uLzEwOwoJfQoJcmV0dXJuIHN1bTsKfQoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglsbCBuOwoJY2luPj5uOwoJdmVjdG9yPGxsPmFycihuKTsKCWZvcihsbCBpPTA7aTxuO2krKykgY2luPj5hcnJbaV07CglsbCBhbnM9LTE7Cgl1bm9yZGVyZWRfbWFwPGxsLGxsPm1wOwoJZm9yKGxsIGk9MDtpPG47aSsrKXsKCQlsbCB4PWRpZ2l0U3VtKGFycltpXSk7CgkJaWYobXAuY291bnQoeCkpewoJCQlsbCBjdXJyPWFycltpXSttcFt4XTsKCQkJYW5zPW1heChhbnMsY3Vycik7CgkJCW1wW3hdPW1heChtcFt4XSxhcnJbaV0pOwoJCX0KCQllbHNlIG1wW3hdPWFycltpXTsKCX0KCWNvdXQgPDxhbnM8PGVuZGw7CgkKCXJldHVybiAwOwp9