#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define bit(n) (1LL<<(n)) #define sz(x) ((int)(x).size()) #define fst first #define snd second using ll=long long;using pii=pair;using vb=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; template T read() {T t; cin >> t; return t;} template bool amax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } void Main() { string s; cin >> s; int n = sz(s); map c3; int k = 3; int comb = (1 << k) - 1; while (comb < 1 << n) { vi ds; rep(i, n) { if (comb & bit(i)) { ds.push_back(s[i]-'0'); } } if (ds[0] != 0 && ds[1] == ds[2] && ds[0] != ds[1]) { c3[comb] = ds[0] * 100 + ds[1] * 10 + ds[2]; //_p("%d:%d\n", comb, c3[comb]); } int x = comb & -comb, y = comb + x; comb = ((comb & ~y) / x >> 1) | y; } vi dp(bit(n)); rep(i, bit(n)) { if (c3.count(i)) dp[i] = c3[i]; } rep(i, bit(n)) if (dp[i]) { forr(ccw, c3) { if ((i & ccw.fst) == 0) { amax(dp[i|ccw.fst], dp[i] + ccw.snd); } } } int ans = *max_element(all(dp)); cout << ans << endl; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }