#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
int dfs(string S){
    int score = 0;
    rep(i,0,S.size())rep(j,i+1,S.size())rep(k,j+1,S.size()){
        if(S[i] != '0' && S[i] != S[j] && S[j] == S[k]){
            int p = S[i] * 100 + S[j] * 10 + S[k] - '0' * 111;
            string T = S;
            T.erase(i,1);
            T.erase(j-1,1);
            T.erase(k-2,1);
            score = max(score, dfs(T) + p);
        }
    }
    return score;
}
main(){
    string S;
    cin >> S;
    cout << dfs(S) << endl;
}