#!/usr/bin/env python3

import itertools
import sys


REC_LIMIT = 10000


def cww_score(x):
    if x // 1000 > 0:
        return
    c, ww = divmod(x, 100)
    if c == 0:
        return
    w, m = divmod(ww, 11)
    if m != 0 or c == w:
        return
    else:
        return x


def compute_maximum_score(n):
    a = [int(c) for c in str(n)]
    all_digits = frozenset(range(len(a)))
    memo = dict()

    def rec(used_digits):
        if used_digits in memo:
            return memo[used_digits]
        res = 0
        unused_digits = all_digits - used_digits
        for idxs in itertools.combinations(unused_digits, 3):
            i, j, k = sorted(idxs)
            cww = 100 * a[i] + 10 * a[j] + a[k]
            score = cww_score(cww)
            if score is None:
                continue
            new_used_digits = used_digits | {i, j, k}
            res = max(res, rec(new_used_digits) + score)
        memo[used_digits] = res
        return res

    return rec(frozenset())


def main():
    sys.setrecursionlimit(REC_LIMIT)
    n = int(input())
    print(compute_maximum_score(n))


if __name__ == '__main__':
    main()