Confined Catching

문제

You are playing a board game against an AI on a square grid consisting of $n\times nn\backslash times\; n$ cells. You have two game pieces and the AI has one, and each piece is placed in one of the grid cells. Your goal is to "catch" the AI's piece, that is, one (or both) of your pieces has to lie in the same cell as the AI's piece after one of your turns. When this happens, you win and the game ends. You lose if you have not won after 600 turns.

Each turn, you have up to five movement options per piece: You can move a piece up, down, left, or right to an adjacent cell (if there is one) or let the piece remain in its current cell. The AI has the same options for its piece in each of its turns. Of course, you can move your pieces completely independently from one another and even have them occupy the same cell.

Your goal is simple: Win the game! You can safely assume that this is always possible.

입력

Before it is your first turn, your program will receive:

• One line with an integer $nn$ ($3\le n\le 1003\; \backslash le\; n\; \backslash le\; 100$), giving the size of the grid.
• One line with four integers $x_1,y_1,x_2,y_{2}x\_1,y\_1,x\_2,y\_2$ ($1\le x_1,y_1,x_2,y_2\le n1\; \backslash le\; x\_1,y\_1,x\_2,y\_2\; \backslash le\; n$), giving your pieces' initial positions.
• One line with two integers $x,yx,y$ ($1\le x,y\le n1\; \backslash le\; x,y\; \backslash le\; n$), giving the AI's piece's initial position.

You can safely assume that your pieces do not lie in the same cell as the AI's piece (but they may lie in the same cell as each other).