Rearrange Digits in Descending Order

Given a positive integer \(n\), rearrange its digits in descending order to form a new integer \(m\). For example, if \(n = 32451\), the output should be \(54321\). This problem requires sorting the digits of the number and outputting the resulting integer. The input will always be a valid positive integer. Handle cases including single digits, repeated digits, and the presence of zeros.

inputFormat

The input consists of a single line containing a positive integer \(n\). Note that the number does not have any leading zeros (except the number 0 itself).

outputFormat

Output a single integer which is obtained by rearranging the digits of \(n\) in descending order. The result must be printed to stdout.

32451

54321