// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

int dp[1 << 13];
signed main() {
    string s; cin >> s;

    int N = s.size();
    for(int bit=0; bit<(1<<N); bit++) {
        for(int i=0; i<N; i++) {
            if(bit >> i & 1) continue;
            for(int j=i+1; j<N; j++) {
                if(bit >> j & 1) continue;
                for(int k=j+1; k<N; k++) {
                    if(bit >> k & 1) continue;
                    if(s[j] != s[k]) continue;
                    if(s[i] == '0') continue;
                    if(s[i] == s[j]) continue;

                    int score = (s[i] - '0') * 100 + (s[j] - '0') * 10 + (s[k] - '0');
                    int nbit = bit | (1 << i) | (1 << j) | (1 << k);
                    chmax(dp[nbit], dp[bit] + score);
                }
            }
        }
    }
    cout << *max_element(dp, dp + (1<<N)) << endl;
    return 0;
}