License plates#9090

License plates

1 second
64 megabytes
Easy

Cossack Vus and Lady enjoy playing a game while driving. They look at the number on the car's license plate and aim to make it divisible by using the fewest operations possible.

An operation consists of adding or subtracting one from any digit. However, digits must remain between and ; you cannot subtract from or add to .

To make the game more challenging, they added a rule: among all possible solutions, they must find the lexicographically smallest one.

In Potokoland, car license plates are quite large, making this game difficult. Therefore, they need you to write a program to play for them.

Input

A single line contains a numeric string (1 \leq |s| \leq 1\,000\,000), where is the length of the string. Note that the string can start with .

Output

Output the solution to the problem on a single line.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading

Example 3

Loading
Loading

Note

In the first example, you can transform into using operations, or into using operations, which is more efficient.

In the second example, you can change to with operations, or to with operations, which is more efficient.

In the third example, is already divisible by , so it is the solution.

String is lexicographically smaller than string if one of the following conditions is met:

• is a prefix of , but a \neq b;

• at the first position where and differ, the character in comes earlier in the alphabet than the corresponding character in .