import java.util.* ;
import java.io.* ;
public class Main
{
public static int digitsum( int a) {
int sum= 0 ;
while ( a> 0 ) {
sum+= a% 10;
a= a/ 10 ;
}
return sum;
}
public static void main
( String [ ] args
) { Scanner sc
= new Scanner
( System .
in ) ; int n= sc.nextInt ( ) ;
int [ ] nums = new int [ n] ;
for ( int i= 0 ; i< n; i++ ) {
nums[ i] = sc.nextInt ( ) ;
}
HashMap
< Integer ,Integer
> f
= new HashMap
<> ( ) ; //key = digitsum and value =nums[i]
int res=- 1 ;
for ( int i= 0 ; i< n; i++ ) {
int k = digitsum( nums[ i] ) ;
int v= nums[ i] ;
if ( f.containsKey ( k) ) {
int summ = f.get ( k) + v;
res
= Math .
max ( res, summ
) ; }
f.
put ( k,
Math .
max ( f.
getOrDefault ( k,
0 ) ,v
) ) ; }
System .
out .
print ( "Max sum of two numbers whose digits add up to equal sum : " + res
) ; }
}
aW1wb3J0IGphdmEudXRpbC4qOwppbXBvcnQgamF2YS5pby4qOwoKcHVibGljIGNsYXNzIE1haW4KeyAgIAogICAgcHVibGljIHN0YXRpYyBpbnQgZGlnaXRzdW0oaW50IGEpewogICAgICAgIGludCBzdW09MDsKICAgICAgICB3aGlsZShhPjApewogICAgICAgICAgICBzdW0rPWElMTA7CiAgICAgICAgICAgIGE9YS8xMDsKICAgICAgICB9CiAgICAgICAgcmV0dXJuIHN1bTsKICAgIH0KCXB1YmxpYyBzdGF0aWMgdm9pZCBtYWluKFN0cmluZ1tdIGFyZ3MpIHsKCQlTY2FubmVyIHNjID0gbmV3IFNjYW5uZXIoU3lzdGVtLmluKTsKCQlpbnQgbj1zYy5uZXh0SW50KCk7CgkJaW50W10gbnVtcyA9IG5ldyBpbnRbbl07CgkJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJICAgIG51bXNbaV09c2MubmV4dEludCgpOwoJCX0KCQlIYXNoTWFwPEludGVnZXIsSW50ZWdlcj5mID0gbmV3IEhhc2hNYXA8PigpOwoJCS8va2V5ID0gZGlnaXRzdW0gYW5kIHZhbHVlID1udW1zW2ldCgkJCgkJaW50IHJlcz0tMTsKCQlmb3IoaW50IGk9MDtpPG47aSsrKXsKCQkgICAgaW50IGsgPSBkaWdpdHN1bShudW1zW2ldKTsKCQkgICAgaW50IHY9bnVtc1tpXTsKCQkgICAgCgkJICAgIGlmKGYuY29udGFpbnNLZXkoaykpewoJCSAgICAgICAgaW50IHN1bW0gPSBmLmdldChrKSArIHY7CiAgICAgICAgICAgICAgICByZXMgPSBNYXRoLm1heChyZXMsIHN1bW0pOwoJCSAgICB9CgkJICAgIGYucHV0KGssTWF0aC5tYXgoZi5nZXRPckRlZmF1bHQoaywwKSx2KSk7CgkJfQoKCQlTeXN0ZW0ub3V0LnByaW50KCJNYXggc3VtIG9mIHR3byBudW1iZXJzIHdob3NlIGRpZ2l0cyBhZGQgdXAgdG8gZXF1YWwgc3VtIDogIiArIHJlcyk7Cgl9Cn0=