#include <bits/stdc++.h>
#define MOD 1000000007

using namespace std;

typedef long long ll;
typedef pair<int,int> ii;

int used[20];
string s;
int tkn;

int dfs(){
    if(s.length()-tkn<3)
        return 0;
    int best=0;
    for(int ctr1=0;ctr1<s.length();ctr1++)
        for(int ctr2=ctr1+1;ctr2<s.length();ctr2++)
            for(int ctr3=ctr2+1;ctr3<s.length();ctr3++)
                if(!used[ctr1] && !used[ctr2] && !used[ctr3] && s[ctr1]!='0' && s[ctr1]!=s[ctr2] && s[ctr2]==s[ctr3]){
                    used[ctr1] = used[ctr2] = used[ctr3] = 1;
                    best=max(best,(s[ctr1]-'0')*100+(s[ctr2]-'0')*10+(s[ctr3]-'0')+dfs());
                    used[ctr1] = used[ctr2] = used[ctr3] = 0;
                }
    return best;
}


int main()
{
    cin>>s;
    cout<<dfs();
}