#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}


signed main(void) {
    string s;
    cin >> s;
    int n = s.size();
    vi dp(1 << n);
    for(int bit = (1 << n)-1; bit > 0; bit--){
        rep(i,n)loop(j,i+1,n)loop(k,j+1,n){
            if((bit & 1<<i) && (bit & 1<<j) && (bit & 1<<k)){
                if(s[i] != s[j] && s[j] == s[k]){
                    int ne = bit - (1<<i) - (1<<j) - (1<<k);
                    int score = (s[i]-'0')*100 + (s[j]-'0')*10 + (s[k]-'0');
                    dp[ne] = max(dp[ne], dp[bit]+score);
                }
            }
        }
    }
    int ans = 0;
    rep(i, 1 << n)ans = max(ans, dp[i]);
    cout << ans << endl;
}