import heapq
import math
def maxsum_modulo3_1(L):
remainder = [], [], [] # all remainder[r] % 3 == r
for x in L:
remainder[x % 3].append(x)
# 00 01 02
# 11 12
# 22
maxsum = sentinel = -math.inf # less than any integer sum
if remainder[0] and remainder[1]: # (0 + 1) % 3 == 1
maxsum = max(remainder[0]) + max(remainder[1])
if len(remainder[2]) > 1: # (2 + 2) % 3 == 1
maxsum = max(maxsum, sum(heapq.nlargest(2, remainder[2])))
if maxsum is sentinel:
raise ValueError("can't find any sum % 3 == 1")
return maxsum
print(maxsum_modulo3_1(map(int, input().split())))
aW1wb3J0IGhlYXBxCmltcG9ydCBtYXRoCgpkZWYgbWF4c3VtX21vZHVsbzNfMShMKToKICAgIHJlbWFpbmRlciA9IFtdLCBbXSwgW10gICMgYWxsIHJlbWFpbmRlcltyXSAlIDMgPT0gcgogICAgZm9yIHggaW4gTDoKICAgICAgICByZW1haW5kZXJbeCAlIDNdLmFwcGVuZCh4KQoKICAgICMgMDAgMDEgMDIKICAgICMgICAgMTEgMTIKICAgICMgICAgICAgMjIKICAgIG1heHN1bSA9IHNlbnRpbmVsID0gLW1hdGguaW5mICAjIGxlc3MgdGhhbiBhbnkgaW50ZWdlciBzdW0KICAgIGlmIHJlbWFpbmRlclswXSBhbmQgcmVtYWluZGVyWzFdOiAgIyAoMCArIDEpICUgMyA9PSAxCiAgICAgICAgbWF4c3VtID0gbWF4KHJlbWFpbmRlclswXSkgKyBtYXgocmVtYWluZGVyWzFdKQogICAgaWYgbGVuKHJlbWFpbmRlclsyXSkgPiAxOiAgIyAoMiArIDIpICUgMyA9PSAxCiAgICAgICAgbWF4c3VtID0gbWF4KG1heHN1bSwgc3VtKGhlYXBxLm5sYXJnZXN0KDIsIHJlbWFpbmRlclsyXSkpKQogICAgaWYgbWF4c3VtIGlzIHNlbnRpbmVsOgogICAgICAgIHJhaXNlIFZhbHVlRXJyb3IoImNhbid0IGZpbmQgYW55IHN1bSAlIDMgPT0gMSIpCiAgICByZXR1cm4gbWF4c3VtCgpwcmludChtYXhzdW1fbW9kdWxvM18xKG1hcChpbnQsIGlucHV0KCkuc3BsaXQoKSkpKQ==