#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

ll ans;
void calc (string s, ll score) {
  int len = s.length();
  ans = max(ans, score);
  if(len < 3) return;
  FOR(i,0,len-2){
    FOR(j,i+1,len-1){
      FOR(k,j+1,len){
        if(s[j] == s[k] && s[k] != s[i] && s[i] != '0') {
          string ns = "";
          FOR(l,0,len) {
            if(l == i || l == j || l == k) continue;
            ns += s[l];
          }
          calc(ns, score + 100 * (s[i] - '0') + 10 * (s[j] - '0') + (s[k] - '0'));
        }
      }
    }
  }
  return;
}

int main(){
  string ss;
  cin >> ss;
  ans = 0;
  calc(ss, 0);
  cout << ans << endl;
  return 0;
}