eolymp
Problems

Interesting Sum

Interesting Sum

Time limit 1 second
Memory limit 128 MiB

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 data

One integer n (100n999).

Output data

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

Examples

Input example #1
524
Output example #1
787