#include <bits/stdc++.h>

using namespace std;

int dp[1<<13];
int arr[1<<13];
int main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  string s;

  cin >> s;

  int n = s.length();

  for(int i=0;i<n;i++)
  {
    for(int j=i+1;j<n;j++)
    {
      for(int k=j+1;k<n;k++)
      {
        if(s[j]!=s[i] && s[j]==s[k] && s[i]!='0')
        {
            int val = (s[i]-'0')*100;
            val += (s[j]-'0')*10;
            val += (s[k]-'0');
            arr[(1<<i) + (1<<j) + (1<<k)] = val;
        }
      }
    }
  }

  for(int i=0;i<(1<<n);i++)
  {
    vector <int> v;
    for(int j=0;j<n;j++)
    {
      if((i&(1<<j))==0)
      {
        v.push_back(j);
      }
    }
    int m = v.size();
    for(int j=0;j<m;j++)
    {
      for(int k=j+1;k<m;k++)
      {
        for(int l=k+1;l<m;l++)
        {
          int mask = i + (1<<v[j]) + (1<<v[k]) + (1<<v[l]);
          dp[mask] = max(dp[mask],dp[i] + arr[mask - i]);
        }
      }
    }
  }

  int res = 0;
  for(int i=0;i<(1<<n);i++) res = max(res,dp[i]);

  cout << res << '\n';

  return 0;
}