A. Ornament
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

The ornament has a square shape and consists of equal square pixels. Each pixel can be either red or white. An ornament is considered to be balanced if any square 2 $$$\times$$$ 2 contains both white and red pixels, but their amounts are not equal to each other. Give an example of any balanced ornament.

Input

The input contains a single integer $$$n, (2 \leq n \leq 5000)$$$ - the width and height of the ornament in pixels.

Output

Output $$$n$$$ lines of $$$n$$$ characters $$$R$$$ or $$$W$$$ that show the color of the pixels in the ornament (red and white respectively). From the entire set of possible answers, you can print any.

Example
Input
3
Output
RRR
WRW
WWW