You are given a string S of length n, representing a large integer. Your task is to perform exactly one swap between two digits at different positions i and j (1 \le i < j \le n) such that the resulting integer is the largest possible.
Leading zeros are strictly prohibited in the input and in the final output. If the required swap results in an integer that begins with a zero, you must remove the leading zero(s) before printing the final answer (for example, if a swap resulted in the string "075", the correct output would be "75").
Input
The first line contains a single integer n (2 \le n \le 10^8), the number of digits in the string.
The second line contains a string S of n digits (0 \le S_i \le 9).
Output
Print the string of n digits representing the maximum possible integer that can be formed by performing exactly one swap.
Examples
| standard input | standard output |
|---|
| 5
27366
| 72366
|
| 3
123
| 321
|