#include <bits/stdc++.h>
using namespace std;

// 基本テンプレート
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a); i>n; --i)
#define each(x,y) for(auto &(x):(y))
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define cauto const auto&
#define UNIQUE(v) v.erase( unique(all(v)), v.end() );
#define len(x) ((int)(x).size())
#define length(a)   (sizeof(a)/sizeof(a[0]))
#define mp make_pair
#define eb emplace_back
template<typename T> inline bool inside(T y, T x, T h, T w) { return 0 <= y && y < h && 0 <= x && x < w; };

// デバッグ用
template <class T> inline void print(T t){cout << t << endl;}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
#define dbg(v) for(auto i : v) { cout << i << " "; } cout << endl;

// 型
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;



// 定数
#define PI acos(-1.0)
//constexpr int EPS = (1e-9);
//constexpr int INF = 100000000;

// 4近傍
//constexpr int dx[] = {1, 0, -1, 0};
//constexpr int dy[] = {0, 1, 0, -1};


// 8近傍
//constexpr int dy[]={0,0,1,-1,1,1,-1,-1};
//constexpr int dx[]={1,-1,0,0,1,-1,1,-1};


//ll mod = 1000007;

int cnt = 0;

inline void f(pair<string, int> m) {
	string s = m.first;
	int len_s = len(s);
	int n = m.second;
	if(len_s < 3 || (len_s == 3 && s[1] != s[2])) {
		if(n > cnt) cnt = n;
		return;
	}

	rrep(i, len_s - 1, 1) {
		rrep(j, i - 1, 0) {
			rrep(k, j - 1, -1) {
				if(s[i] != s[j] || s[k] == '0' || s[k] == s[j]) continue;				int t = (s[k] - '0') * 100 + (s[j] - '0') * 10 + s[i] - '0';
				string tmp_s = s.substr(0, k) + s.substr(k + 1, j - k - 1) + s.substr(j + 1, i - j - 1);
				f(mp(tmp_s, n + t));
			}
		}
	}
}

int main() {
//	cout << setprecision(15) << fixed;

	string s; cin >> s;
	if(len(s) < 3) { P(0); return 0; }

	f(mp(s, 0));

	P(cnt);

	return 0;
}