#include <cstdio>
#include <cmath>

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

typedef long long   signed int LL;
typedef long long unsigned int LU;

template<typename T> void swap(T &x, T &y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T &a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T &a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

#define F(n) inc(i[n], len) { if(len <= n) { i[n] = len; } if(memo[ i[n] ]) { continue; } memo[ i[n] ] = 1;
#define G(n) memo[ i[n] ] = 0; }

char s[14];
int len;

bool cww(int a, int b, int c) {
	return (a < b && b < c && s[a] != '0' && s[a] != s[b] && s[b] == s[c]);
}

int val(int a, int b, int c) {
	return (s[a] - '0') * 100 + (s[b] - '0') * 10 + (s[c] - '0');
}

int ans;

int search(LL b, int d) {
	if(len - d < 3) { return 0; }
	
	int v = 0;
	inc(i, len) {
	inc(j, len) {
	inc(k, len) {
		if(
			(b & (1LL << i)) == 0 &&
			(b & (1LL << j)) == 0 &&
			(b & (1LL << k)) == 0 &&
			cww(i, j, k)
		) {
			int cc = val(i, j, k);
			int vv = search(b | (1LL << i) | (1LL << j) | (1LL << k), d + 3);
			setmax(v, cc + vv);
		} 
	}
	}
	}
	
	return v;
}

int main() {
	scanf("%s", s);
	
	while(s[len] != '\0') { len++; }
	
	printf("%d\n", search(0LL, 0) );
	
	return 0;
}