#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

int num[4];

int main(void) {
    int i, j;
    string s;
    cin >> s;
    int ans = 0;
    vector<int> vec;
    REP (i,s.size()) vec.push_back(i/3);
    do {
        REP (i,4) num[i] = 0;
        REP (i,s.size()) {
            num[vec[i]] = num[vec[i]] * 10 + s[i] - '0';
        }
        int cnt = 0;
        REP (i,4) if (num[i] >= 100 && num[i] % 100 % 11 == 0 && num[i] / 100 != num[i] % 10) {
            cnt += num[i];
        }
        ans = max(ans,cnt);
    } while (next_permutation(vec.begin(),vec.end()));
    cout << ans << endl;
    return 0;
}