#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;

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

int main(void){
	cin >> n;
	set<int> s;
	printf("%d\n", dfs(s, 0));
	return 0;
}