# Problem D

Map

A pirate’s treasure map typically contains a series of
instructions which, if followed, lead you from the landing
place on a desert isle to *the spot marked X* where the
treasure is buried. You are to construct such a series of
instructions for a particular desert isle.

The island is a circle with radius $r$ paces whose centre is at $(0,0)$. Relative to the centre, the point $(0,1)$ is north, $(0,-1)$ is south, $(1,0)$ is east, and $(-1,0)$ is west. Also, $(1,1)$ is northeast, $(1,-1)$ is southeast, $(-1,1)$ is northwest, and $(-1,-1)$ is southwest.

The landing place, on the circumference, is specified by its coordinates. The spot marked X, on the surface of the island is also specified by its coordinates.

Each instruction in the sequence should have the form

direction distance

where `direction` is one of
$\{ $ `north`, `south`,
`east`, `west`,
`northeast`, `northwest`, `southeast`,
`southwest` $\} $ and `distance` is a non-negative real number
indicating the number of paces to be travelled in the given
direction. When executed as a sequence the instructions should
lead from the landing place to the spot marked X without
leaving the island. The total distance (that is, the sum of the
distances in your sequence) should be minimized. From the
possible sequences that minimize total distance, choose one
with the minimum number of instructions.

## Input

Input will consist of up to $150$ test cases, followed by a line containing $-1$. Each test case consists of a single line containing five real numbers (with at most $10$ digits after the decimal point): $0.01 \le r \le 1\, 000$, $x$, $y$, $X$, and $Y$. $r$ is the radius of the island; $x,y$ are the coordinates of the landing place; $X,Y$ are the coordinates of the spot marked X. The landing place and the spot marked X are distinct.

## Output

For each test case, output the sequence, one instruction per line. Distances should be accurate to ten places after the decimal, as shown. Output an empty line between test cases. If there are many sequences achieving minimum distance and minimum number of instructions, you may output any one.

Sample Input 1 | Sample Output 1 |
---|---|

100.0 0.0 100.0 25.0 50.0 100.0 0.0 100.0 25.0 50.0 -1 |
south 25.0000000000 southeast 35.3553390593 south 25.0000000000 southeast 35.3553390593 |