Mr$.$ Jason has captured your friend and has put a collar around his neck. He has locked it with a given locking key. It can only be opened now with an unlocking key. Your friend has seen the locking key but he does not know about the unlocking key. Given the locking key, one can figure out the unlocking key which is the smallest $($in magnitude$)$ permutation of the digits of that number and it never starts with zero. Help your friend to write an algorithm that takes the locking key as an input and outputs the unlocking key. Input The input consists of an integerkey, representing the locking key. Output Print an integer representing the unlocking key. Constraints $-107$ key $107$ Note There exists a possible answer for every input. Example Input: $756$ Output: $567$ Explanation: The smallest permutation formed with digits $5,6,$ and $7$ is $567.$ So$,$ the output is $567.$