A. Exchange of Knights
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

There is a piece of a chessboard of strange shape consisting of ten squares. On the board, there are two black knights and two white knights. The task is to swap them (that is, to make the black knights move to the places of the white ones, and vice versa).

Recall that a knight moves in an "L" shape — two squares horizontally and one square vertically, or one square vertically and two squares horizontally. A move can only be made to an empty square on the board.

To submit your solution, click the "Submit code" link (above the problem statement). In the source code field, enter the found moves. Each move should be entered on a separate line in the form of two numbers separated by a space — the number of the starting and ending square (the numbering of the squares is shown in the picture). Do not write anything else. When submitting the solution, select the PHP language (you do not need to know this language, it is just a feature of the system).

Scoring

A complete solution will receive 100 points, a solution in which three knights are correctly placed will receive 75 points, two knights will receive 50 points, and one knight will receive 25 points. In all cases, all moves must be correct (that is, there must be a knight in the starting square, and the ending square must be empty).