Numbers from digits#2323

Numbers from digits

1 second

128 megabytes

Very easy

A non-negative integer $n$ is given. Using all its digits, form the largest possible number, and then the smallest one. Print the sum of these two numbers.

For example, for $n = 56002$ n = 56002, the largest number is $65200$ , and the smallest one is $256$ (leading zeros in the number $00256$ are not considered). The required sum is $65200 + 256 = 65456$ 65200 + 256 = 65456.

Input

One integer $n$ ( $0 \leq n \leq 1 0^{8}$ 0 \leq n \leq 10^8).

Output

Print the sum of the largest and the smallest numbers that can be obtained from $n$ by rearranging its digits.

Examples

Example 1

Loading

n = 56002

65200 + 256 = 65456

0 \leq n \leq 1 0^{8}