#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main(){

   string N;
   cin>> N;

   vector<int> v;
   for(int i=0; i<N.size(); i++) v.push_back(i);
   int score=0;
   do{
      int s=0;
      for(int i=0; i<v.size(); i+=3){
         if(i+3>v.size()) break;
         int c=N[v[i]]-'0', w1=N[v[i+1]]-'0', w2=N[v[i+2]]-'0';
         if(c==0||c==w1||c==w2||w1!=w2) continue;
         if(!(v[i]<v[i+1]&&v[i+1]<v[i+2])) continue;
         s+=c*100+w1*10+w2;
      }
      score=max(s, score);
   }while(next_permutation(v.begin(), v.end()));

   cout<< score<< endl;

   return 0;
}