#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

ll ret;

void calc(string& N, ll now){
  int n = N.length();
  ret = max(ret, now);
  rep(i,n){
    REP(j,i+1,n){
      REP(k,j+1,n){
        if(N[i]=='0') continue;
        if(N[i]=='-' || N[j]=='-' || N[k]=='-') continue;
        ll x = (int)(N[i]-'0')*100 + (int)(N[j]-'0')*10 + (int)(N[k]-'0');
        if(N[i] != N[j] && N[j] == N[k]){
          char a = N[i];
          char b = N[j];
          char c = N[k];
          N[i] = N[j] = N[k] = '-';
          calc(N,now+x);
          N[i] = a;
          N[j] = b;
          N[k] = c;
        }
      }
    }
  }
}

int main(){
  ios::sync_with_stdio(false);

  string N;
  cin >> N;

  ret = 0;
  calc(N, 0);
  cout << ret << endl;
  
  return 0;
}