*a, = map(int,input())
n = len(a)
N = 1<<n
from itertools import combinations
three = []
thval = []
for p,q,r in combinations(range(n),3):
    if a[p] == 0 or a[q] != a[r] or a[p] == a[q]: continue
    three.append((1<<p)+(1<<q)+(1<<r))
    thval.append(a[p]*100+a[q]*10+a[r])
dp = [-1]*N
dp[0] = 0
for mask in range(N):
    if dp[mask] < 0: continue
    for v,w in zip(three,thval):
        if mask&v==0:
            dp[mask^v] = max(dp[mask^v],dp[mask]+w)
print(max(dp))