#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>

using namespace std ;

int BrCif ( int i )
{
    
    return i > 0 ? ( int ) log10 ( (double ) i ) + 1 : 1 ;
    
}


int main()
{
    
    int A , B , C , AD , BD , CD ;
    
    cin >> A ; 
    cin >> B ;
    cin >> C ;
    
    int KOMB [ 6 ] ;
    
    AD = BrCif ( A ) ;
    BD = BrCif ( B ) ;
    CD = BrCif ( C ) ;
    
    //cout << AD << " " << BD << " " << CD << endl ;
    
    KOMB [ 0 ] = A * ( pow ( 10 , ( BD + CD ) ) ) + B * ( pow ( 10 , CD ) ) + C ;
    KOMB [ 1 ] = A * ( pow ( 10 , ( BD + CD ) ) ) + C * ( pow ( 10 , BD ) ) + B ;
    KOMB [ 2 ] = B * ( pow ( 10 , ( AD + CD ) ) ) + A * ( pow ( 10 , CD ) ) + C ;
    KOMB [ 3 ] = B * ( pow ( 10 , ( AD + CD ) ) ) + C * ( pow ( 10 , AD ) ) + A ;
    KOMB [ 4 ] = C * ( pow ( 10 , ( AD + BD ) ) ) + B * ( pow ( 10 , AD ) ) + A ;
    KOMB [ 5 ] = C * ( pow ( 10 , ( AD + BD ) ) ) + A * ( pow ( 10 , BD ) ) + B ;
    
/*    for ( int k = 0 ; k < 6 ; k++ )
    {
        
        cout << "\n" << KOMB [ k ] ;
        
    }
  */  
    sort ( KOMB , KOMB + 6 ) ;
    
    /*for ( int k = 0 ; k < 6 ; k++ )
    {
        
        cout << "\n" << KOMB [ k ] ;
        
    }
    */
    cout << KOMB [5] ;
    
}