#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = (a >= b ? a : b)
#define chmin(a, b) a = (a <= b ? a : b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)

int n;
string s;
int dfs(int used) {
    // out("used " << used);
    int ret = 0;
    rep(i, n) rep3(j, i + 1, n) rep3(k, j + 1, n) {
        int tmp = 0;
        if (used & (1 << i) || used & (1 << j) || used & (1 << k)) continue;
        if (s[i] == 0 || s[i] == s[j] || s[j] != s[k]) continue;
        // out(i << " " << j << " " << k);
        int nused = used | (1 << i) | (1 << j) | (1 << k);
        chmax(tmp, dfs(nused));
        string str;
        str += s[i];
        str += s[j];
        str += s[k];
        tmp += stoi(str);
        chmax(ret, tmp);
    }
    return ret;
}
int main() {
    cin >> s;
    n = SZ(s);
    out(dfs(0));
}