#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define all(v) ALL(v)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
#define CININIT cin.tie(0),ios::sync_with_stdio(false)
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }

constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};

int main(){
    string s;cin>>s;
    int n=s.size();
    vector<bool> use(n,0);

    int ans = 0;
    for(int i=9;i>0;i--){       // c
        for(int j=0;j<n;j++) if(s[j]-'0'==i and use[j]==0){
            for(int k=n-1;k>j;k--) for(int l=k-1;l>j;l--){
                if(s[j]!=s[k] and s[k]==s[l] and use[k]==0 and use[l]==0){
                    // s[j]:c , s[k]:w , s[l]:w
                    int c = s[j]-'0';
                    int w = s[k]-'0';
                    ans += (c*100+w*10+w);
                    use[j]=1;
                    use[k]=2;
                    use[l]=2;
                    goto PO;
                }
            }
PO:;
        }
    }

    for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) if(s[i]==s[j] and use[i]==0 and use[j]==0){
        int mini = 100;
        for(int k=0;k<n;k++) if(use[k]==2){
            mini = min(mini,s[k]-'0');
        }
        if(mini!=100){
            int t = s[i]-'0';
            ans -= mini*10 + mini;
            ans += (t*10+t);
        }
    }
    cout << ans << endl;
}