#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
using namespace std;

int main()
{
	string n; cin >> n;

	int ans = 0;

	vector<pair<string,int>>vs;
	vs.push_back(make_pair(n,0));
	while(vs.size()){
		for (int i = 0; i < n.size() - 2; i++) {

			for (int j = i + 1; j < n.size() - 1; j++) {

				for (int k = j + 1; k < n.size(); k++) {
					string s = vs[0].first;
					int cnt = vs[0].second;
					if (s[i] != 'x' && s[j] != 'x' && s[k] != 'x' && s[i] != '0') {
						if (s[j] == s[k]) {
							if (s[i] == s[j])continue;
							cnt += (s[i] - '0') * 100 + (s[j] - '0') * 10 + (s[k] - '0');
							s[i] = 'x'; s[j] = 'x'; s[k] = 'x';
							vs.push_back(make_pair(s,cnt));
						}
					}
				}
			}
		}
		ans = max(ans, vs[0].second);
		vs.erase(vs.begin());
	}


	cout << ans << endl;

    return 0;
}