#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)

using ll=long long;
using ld=long double;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int, int>;
using vpii=vector<pii>;

template<class T,class U>ostream&operator<<(ostream&os,const pair<T,U>p){os<<"("<<p.fst<<", "<<p.scd<<")";return os;}
template<class T>ostream&operator<<(ostream&os,const vector<T>v){rep(i,v.size()){if(i)os<<", ";os<<v[i];}return os;}
template<typename T>T&max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T&min(T&a,T&b){if(a < b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a < b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a > b){a=b;return true;}return false;}
int in(){int a;scanf("%d",&a);return a;}
ll lin(){ll a;scanf("%lld",&a);return a;}

constexpr int inf = 1e9;
constexpr ll linf = 3e18;
constexpr double eps = 1e-9;

int solve(string s, int d = 0)
{
    int n = s.size();
    if (n < 3) {
        return 0;
    }

    int res = 0;

    rep(i, n) {
        if (s[i] == '0') continue;

        for (int j = i + 1; j < n; ++j) {
            if (s[i] == s[j]) continue;
            for (int k = j + 1; k < n; ++k) {
                if (s[j] != s[k]) continue;

                string nxs = "";
                rep(l, n) {
                    if (l != i && l != j && l != k) {
                        nxs += s[l];
                    }
                }

                int a = (s[i] - '0') * 100 + (s[j] - '0') * 10 + (s[k] - '0');

                chmax(res, a + solve(nxs, d+1));
            }
        }
    }

    return res;
}

int main()
{
    string S; cin >> S;

    cout << solve(S) << endl;
}