#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)

int used[20];
string s;

int main() {
    while (cin >> s) {
        memset(used, 0, sizeof used);
        int n = s.size();
        vector<int> a;
        for (int i = 0; i < n; i++) {
            a.push_back(i / 3);
        }
        int ans = 0;
        do {
            string t[4];
            for (int i = 0; i < n; i++) {
                t[a[i]] += s[i];
            }
            int cand = 0;
            for (auto &T : t) {
                if (T.size() == 3 && T[0] != '0' && T[0] != T[1] && T[1] == T[2]) {
                    cand += stoi(T);
                }
            }
            ans = max(ans, cand);
        } while (next_permutation(a.begin(), a.end()));
        cout << ans << endl;
    }
}