import sys

A = list(map(int, input()))
L = len(A)  # 1-13

def solve(used):
    if used == (1 << L) - 1:
        return 0
    res = 0
    for i in range(0, L - 2):
        if used & (1 << i) or A[i] == 0: continue
        for j in range(i + 1, L - 1):
            if used & (1 << j) or A[i] == A[j]: continue
            for k in range(j + 1, L):
                if used & (1 << k) or A[j] != A[k]: continue
                s = A[i] * 100 + A[j] * 10 + A[k]
                s += solve(used | (1 << i) | (1 << j) | (1 << k))
                if s > res:
                    res = s
    return res

ans = solve(0)

print(ans)