AT_abc432_b [ABC432B] Permute to Minimize

You are given a positive integer $ X $ . Find the minimum value among all positive integers that can be obtained by rearranging the digits appearing in the decimal representation of $ X $ (without leading zeros) **such that there is no leading zero**.

The input is given from Standard Input in the following format: > $ X $

Output the answer.

### Sample Explanation 1 There are four positive integers that can be obtained by rearranging the digits appearing in the decimal representation of $ X $ such that there is no leading zero: $ 903 $ , $ 930 $ , $ 309 $ , $ 390 $ ; the minimum value among them is $ 309 $ . ### Constraints - $ 1\leq X < 10^5 $ - $ X $ is an integer.