Bomber

Time Limit: 1 Second    Memory Limit: 32768 KB
Special Judge

As we know, c.x. loved playing games. Especially she likes a game called "Bomber".

The game is in a maze of size N * N (N <= 50). There are walls, bricks and blanks in the maze. And you can walk on the road. You have many bombs (You may assume that we can provide you any number of bombs). And you can put a bomb on an empty gird. There will be at most one bomb in the maze at one time. You can explode the bomb. The bomb explosion wave will extend infinitely along four directions: up, right, down, left, until it meets a stone wall and stop there, or it meets a brick wall and stop there but also destroy the brick wall to a blank. When you are damaged by your own bomb, you are lost.

At first, you are at gird (1, 1). You should find a way that the bomber can move to the destination (N, N).

Input

First line of each testcase, there is one integer N.

Then N lines followed. Each line contains N characters. "#" for walls, "X" for bricks, and "." for blanks.

Proceed to the end of file.

Output

You should output how the bomber can move to the destination.

There are 4 operations:
1+ a letter [U, D, L, R]: Move to that direction.
2: Put a bomb on the current gird.
3: Explode the bomb.
4: This testcase is end.

We guarantee that there is at least one solution. You may output any of them. And if your output is too long, you may get an "OLE".

Sample Input

3
..X
X.X
XXX

Sample Output

1R
1D
2
1U
1L
3
1D
1R
1R
2
1L
1U
3
1D
1D
1R
4

Submit

Source: JIANG, Yanyan's Contest #1