#include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) (a)<=(n)&&(n)<(b)
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll inf =1e18;

string s;
int dfs(ll f){
    int N=s.size();
    int cnt=0;
    int ret=0;
    REP(i,0,N){
        if(f & (1<<i) || s[i]=='0') continue;
        REP(j,i+1,N){
            if(f & (1<<j)) continue;
            if(s[i]==s[j]) continue;
            REP(k,j+1,N){
                if(f & (1<<k)) continue;
                if(s[j]==s[k]) {
                    cnt = 100*(s[i]-'0') + 10*(s[j]-'0') + (s[k]-'0');
                    cnt += dfs((f|(1<<i)|(1<<j)|(1<<k)));
                    ret = max(ret,cnt);
                }
            }
        }
    }
    return ret;
}

int main(){

    while(cin>>s){
        int ans=dfs(0LL);
        p(ans);
    }

}