#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

string S;
int ans = 0;
int dfs(set<int> s, int sum) {
	ans = max(ans, sum);
	for (int i = 0; i < S.length(); i++) {
		if (S[i] == '0' || s.count(i) == 1) continue;
		for (int j = i + 1; j < S.length(); j++) {
			if (S[i] == S[j] || s.count(j) == 1) continue;
			for (int k = j + 1; k < S.length(); k++) {
				if (S[j] != S[k] || s.count(k) == 1) continue;
				set<int> tm = s;
				int num = 0;
				num += (S[i] - '0') * 100;
				num += (S[j] - '0') * 10;
				num += (S[k] - '0') * 1;
				tm.insert(i); tm.insert(j); tm.insert(k);
				int ret = dfs(tm, sum + num);
				ans = max(ans, sum);
			}
		}
	}
	return ans;
}

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	cin >> S;
	set<int> s;
	cout << dfs(s, 0) << endl;


    return 0;
}