import sys
from collections import defaultdict

n = input().strip()
s = list(n)
L = len(s)
if L < 3:
    print(0)
    sys.exit()

# Generate all possible valid triples (i, j, k) with i < j < k and forms a cww number
triples = []
for i in range(L):
    for j in range(i+1, L):
        for k in range(j+1, L):
            a, b, c = s[i], s[j], s[k]
            if a == b or b != c or a == '0':
                continue
            value = int(a + b + c)
            triples.append((i, j, k, value))

if not triples:
    print(0)
    sys.exit()

full_mask = (1 << L) - 1
dp = [-sys.maxsize] * (1 << L)
dp[full_mask] = 0  # Initial state: all digits available, score 0

# Group masks by the number of set bits and process them in descending order
masks_by_bits = defaultdict(list)
for mask in range(1 << L):
    cnt = bin(mask).count('1')
    masks_by_bits[cnt].append(mask)

# Sort the keys in descending order to process masks with most bits first
sorted_bit_counts = sorted(masks_by_bits.keys(), reverse=True)

for bit_count in sorted_bit_counts:
    for mask in masks_by_bits[bit_count]:
        if dp[mask] == -sys.maxsize:
            continue
        # Check all valid triples
        for i, j, k, val in triples:
            if (mask & (1 << i)) and (mask & (1 << j)) and (mask & (1 << k)):
                new_mask = mask ^ ((1 << i) | (1 << j) | (1 << k))
                if dp[new_mask] < dp[mask] + val:
                    dp[new_mask] = dp[mask] + val

# The maximum score is the maximum value in dp, or 0 if no triples were chosen
max_score = max([x for x in dp if x != -sys.maxsize] + [0])
print(max_score)