#include<bits/stdc++.h>
using namespace std;
int dp[1<<15];
string s;
int n;
int rec(int b){
  if(~dp[b]) return dp[b];
  int res=0,i,j,k;
  for(i=0;i<n;i++){
    if(b>>i&1) continue;
    if(s[i]=='0') continue;
    for(j=i+1;j<n;j++){
      if(b>>j&1) continue;
      for(k=j+1;k<n;k++){
	if(b>>k&1) continue;
	if(s[i]!=s[j]&&s[j]==s[k]){
	  //printf("%d %d %d\n",i,j,k);
	  //printf("%c %c %c\n",s[i],s[j],s[k]);
	  res=max(res,
		  rec((b|(1<<i)|(1<<j)|(1<<k)))
		  +(s[i]-'0')*100+(s[j]-'0')*10+(s[k]-'0'));
	}
      }
    }
  }
  return dp[b]=res;
}
int main(){
  cin>>s; 
  memset(dp,-1,sizeof(dp));
  n=s.size();
  cout << rec(0) << endl;
  return 0;
}