Skip to content

Latest commit

 

History

History

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 

Interesting Sum

Given a three-digit positive integer n. Find the sum of the largest and the smallest three-digit numbers that can be formed from a permutation of n numbers.

Input

One integer n (100 ≤ n ≤ 999).

Output

Print the sum of the largest and the smallest three-digit number.

Input example #1

524

Output example #1

787