Chess Puzzle#1488
Boris loves various chess puzzles. He has a younger brother named Vova. Boris enjoys giving simple puzzles to Vova and, as a reward, gives him a candy if he solves them. However, Vova is not very fond of chess, but he enjoys programming.
This time, Boris gave Vova the following puzzle: On an 8 \times 8 chessboard, there is a knight already placed. It is required to place two more chess pieces—a rook and a bishop—such that both pieces attack the knight, but they do not attack each other, and the knight does not attack them. Since Vova is not very skilled in programming yet, he asked you to help him solve this puzzle.
Recall that a knight attacks squares that are two squares away horizontally and one square vertically, or two squares vertically and one square horizontally from its position.
A rook attacks all squares in the same row or column as itself. A bishop attacks all squares along the diagonals it occupies.
The first line of the input contains the position of the knight in the following format: first, a letter from to indicating the column in which the knight is located, then a digit from to indicating the row.
In the first line, output the position of the rook in the same format. In the second line, output the position of the bishop.
It is guaranteed that the required arrangement always exists.
Example 1