#include <bits/stdc++.h>
using namespace std;

int solve(vector<int> N,vector<bool> isUsed){
    int ans=0;
    vector<bool> give;
    for(int i=0;i<N.size();i++){
        for(int j=i+1;j<N.size();j++){
            for(int k=j+1;k<N.size();k++){
                if(isUsed[i]||isUsed[j]||isUsed[k]||N[i]==N[j]||N[j]!=N[k]||N[i]==0)continue;
                give=isUsed;
                give[i]=true;
                give[j]=true;
                give[k]=true;
                ans=max(ans,solve(N,give)+N[i]*100+N[j]*11);
            }
        }
    }
    return ans;
}

int main(){
    string S;
    cin>>S;
    vector<int> N(S.size());
    for(int i=0;i<S.size();i++){
        N[i]=S[i]-'0';
    }
    vector<bool> isUsed(N.size(),false);
    cout<<solve(N,isUsed)<<endl;
}