eolymp
bolt
Try our new interface for solving problems
Problems

Counterfeit check

Counterfeit check

Time limit 1 second
Memory limit 64 MiB

One way of fraud, developed by Ostap Bender, is as follows. He cut a strip of paper containing a few figures of the amount of the check (you can cut and extreme figures), cut it into two parts, rearranged these two places and carefully glued back. Write a program that determines the maximum number that can be obtained as a result of this manipulation.

Input data

In the input file in the first line contains one positive integer not more than 100 digits.

Output data

In the output file display one number - the maximum number that can be obtained as a result of this manipulation, the original number or if the increase is impossible.

Examples

Input example #1
9123650
Output example #1
9651230