#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };

using LL = long long int;
using LD = long double;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

int n;
vi vec;

int cwwCheck(int a, int b, int c) {
	if (a != 0 && a != b && b == c) {
		return 100 * a + 10 * b + c;
	}

	return -1;
}

int solve(vb dp) {
	int score = 0;
	REP(i, n) {
		REP2(j, i + 1, n) {
			REP2(k, j + 1, n) {
				if (dp[i] || dp[j] || dp[k]) continue;

				int x = cwwCheck(vec[i], vec[j], vec[k]);
				if (x == -1) continue;

				vb nextDp = dp;
				nextDp[i] = nextDp[j] = nextDp[k] = true;

				score = max(score, solve(nextDp) + x);
			}
		}
	}

	return score;
}

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

	string s;
	cin >> s;

	n = s.size();
	vec.resize(n);
	REP(i, n) {
		vec[i] = s[i] - '0';
	}

	cout << solve(vb(n)) << endl;
	return 0;
}