The input contains several buildings. The description of each building starts with a single positive integer $N$, the number of corners (polygon vertices), $1 \leq N \leq 1000$. Then there are $N$ pairs of integer numbers $X_i, Y_i$ giving coordinates of individual corners, $|X_i|, |Y_i| ≤ 10\;000$.

You may assume that all corners are listed and no two of them have the same coordinates. The polygon does always exist, it is closed, its sides do not intersect or touch (except neighboring sides, of course), and it contains no “holes” inside. In other words, the outline is formed by one closed line. The order of corners in the input file may be arbitrary.

There is an empty line after each building, then the next one is described. After the last building, there is a single zero that signals the end of input.

For each building, output one line containing $N$ characters without any whitespace between them. The characters should be uppercase letters that specify directions of individual walls (sides) when the building outline is followed. N stands for North (the positive direction of the Y axis), E for East (the positive direction of the X axis), W for West, and S for South. The “walk” should start in the vertex that has been given first in the input and always proceed in the clockwise direction.

The second sample input corresponds to the picture.

Migrated from old NTUJ.