#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
using namespace std;

string n;

int cww(int num){
	int sum1 = 0, t = 0;
	for (int i = 0; i < n.size()-2; i++){
		if (n[i] == '0' || num>>i&1) continue;
		for (int j = i+1; j < n.size()-1; j++){
			if (n[i] == n[j] || num>>j&1) continue;
			for (int k = j+1; k < n.size(); k++){
				if (n[j] != n[k] || num>>k&1) continue;
				t = ((n[i] - '0')*100 + (n[j]- '0')*10 + (n[k]- '0') + cww(num^(1<<i)^(1<<j)^(1<<k)));
				sum1 = max(sum1, t);
			}
		}
		
	}
	return sum1;
}

int main(){
	cin >> n;
	
	cout << cww(0) << endl;
}