#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n;
int a[15];
int dp[1 << 15];

bool cww(int x, int y, int z) {
	if(x == 0) return false;
	if(y != z) return false;
	if(x == y) return false;
	return true;
}

int f(int bit) {
	if(dp[bit] != -1) return dp[bit];
	int ret = 0;
	for(int i = 0; i < n; i++) {
		if(bit >> i & 1) continue;
		for(int j = i + 1; j < n; j++) {
			if(bit >> j & 1) continue;
			for(int k = j + 1; k < n; k++) {
				if(bit >> k & 1) continue;
				if(cww(a[i], a[j], a[k])) {
					int nb = bit;
					nb ^= 1 << i;
					nb ^= 1 << j;
					nb ^= 1 << k;
					ret = max(ret, a[i] * 100 + a[j] * 10 + a[k] + f(nb));
				}
			}
		}
	}
	return dp[bit] = ret;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	ll N;
	cin >> N;

	while(N) {
		a[n++] = N % 10;
		N /= 10;
	}
	reverse(a, a + n);
	memset(dp, -1, sizeof dp);
	if(n <= 2) cout << 0 << endl;
	else cout << f(0) << endl;
}