#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    string N; cin >> N;
    int L = N.size();
    vector<int> dp(1 << L, 0);
    auto is_cww = [](int a, int b, int c) {
        int ok = 1;
        ok &= b == c;
        ok &= a != 0;
        ok &= a != b;
        return make_pair(ok, a * 100 + b * 10 + c);
    };
    rep(S,1<<L) {
        int popcnt = __builtin_popcount(S);
        if((L - popcnt) % 3 == 0) {
            vector<int> I;
            rep(i,L) if(S & (1 << i)) I.push_back(i);
            int n = I.size();
            rep(k,n)rep(j,k)rep(i,j) {
                auto [ok, v] = is_cww(N[I[i]] - '0', N[I[j]] - '0', N[I[k]] - '0');
                if(ok) {
                    dp[S] = max(dp[S], dp[S - (1 << I[i]) - (1 << I[j]) - (1 << I[k])] + v);
                }
            }
        }
    }

    cout << *max_element(dp.begin(), dp.end()) << endl;
}