#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define p(s) cout<<(s)<<endl
using namespace std;

string s;
int dp[1 << 12];
int main() {
	cin>>s;
	int n=s.size();
	REP(mask, 0, 1<<n) {
		REP(i, 0, n) {
			REP(j,i+1,n){
				REP(k,j+1,n){
					if (!(mask & (1<<i))&&!(mask & (1<<j))&&!(mask & (1<<k))&&s[i]!=0&&s[i]!=s[j]&&s[j]==s[k]){
						dp[mask | (1 << i)|(1 << j)|(1 << k)] = max(dp[mask | (1 << i)|(1 << j)|(1 << k)],dp[mask]+100*(s[i]-'0')+10*(s[j]-'0')+s[k]-'0');
					}
				}
			}
		}
	}
	p(dp[(1<<n)-1]);
	return 0;
}