#include <algorithm>
#include <iostream>
#include <vector>

int main() {
    using namespace std;
    auto solve = [&](auto solve, string s) -> int {
        int n = s.size(), res = 0;
        for (int i = 0; i < n; i++) {
            if (s[i] == '0') { continue; }
            for (int j = i + 1; j < n; j++) {
                if (s[i] == s[j]) { continue; }
                for (int k = j + 1; k < n; k++) {
                    if (s[j] != s[k]) { continue; }
                    int x = (s[i] - '0') * 100 + (s[j] - '0') * 10 + (s[k] - '0') * 1;
                    string ns = "";
                    for (int l = 0; l < n; l++) {
                        if (l == i || l == j || l == k) { continue; }
                        ns += s[l];
                    }
                    res = max(res, solve(solve, ns) + x);
                }
            }
        }
        return res;
    };

    string s;
    cin >> s;
    cout << solve(solve, s) << endl;
}