e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more
Problems

Interesting Sum

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 (100n999).

Output

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

Time limit 1 second
Memory limit 128 MiB
Input example #1
524
Output example #1
787