PROGRAMMING:I always play games
LC loves to play games. In order to punish him, his teammates put him in a small dark room to study DFS. If he learns, he can come out of the small dark room and go through the maze. Labyrinth is a rectangle composed of $$n * n $$rooms. Each room has only one channel with its adjacent room. If $$LC $$is in the $$(x, y) $$room, then it can only reach the $$(x + 1, y) (x, y + 1) (x, Y-1) $$room in one step.
Some of the doors of the rooms were soldered to death and could not be entered. You can't walk out of the boundary of the maze, for example, in the $$(1,1) $$room, you can't enter the positions of $$(1,0) (0,1) $.
At the beginning, $$LC $$was locked in a small dark room, which was marked as $$(1,1) $$in the upper left corner of the maze, and $$(n, n) $$in the lower right corner of the maze. Now he wants to know if he has a chance to escape from the maze, because it is possible that his team directly abandoned him and trapped him in the maze palace forever.
###Input format:
The first line gives a positive integer, $$t (1 < = T < = 100) $, indicating the number of sample groups
Next $$t $$group data
The first line gives a positive integer, $$n (1 < = n < = 20) $, indicating that the size of the maze is $$n * n$$
Next, there are $$n $$rows, each giving $$n $$integers.
The number of $$J $$in line $$I $$is $$0, which means that the $$(I, J) $$room is accessible, and $$1 $$means that it is not accessible.
Ensure that $$(1,1) (n, n) $$can enter.
###Output format:
For each group of data, output "lcyyds" in one line. If $$LC $$can walk out of the maze, otherwise output "qwq" without quotation marks.
###Input example:
```in
two
three
0 0 0
1 1 0
1 1 0
three
three
0 0 1
1 1 0
1 1 0
```
###Output example:
```out
LCyyds
QwQ
```
answer：If there is no answer, please comment
Some of the doors of the rooms were soldered to death and could not be entered. You can't walk out of the boundary of the maze, for example, in the $$(1,1) $$room, you can't enter the positions of $$(1,0) (0,1) $.
At the beginning, $$LC $$was locked in a small dark room, which was marked as $$(1,1) $$in the upper left corner of the maze, and $$(n, n) $$in the lower right corner of the maze. Now he wants to know if he has a chance to escape from the maze, because it is possible that his team directly abandoned him and trapped him in the maze palace forever.
###Input format:
The first line gives a positive integer, $$t (1 < = T < = 100) $, indicating the number of sample groups
Next $$t $$group data
The first line gives a positive integer, $$n (1 < = n < = 20) $, indicating that the size of the maze is $$n * n$$
Next, there are $$n $$rows, each giving $$n $$integers.
The number of $$J $$in line $$I $$is $$0, which means that the $$(I, J) $$room is accessible, and $$1 $$means that it is not accessible.
Ensure that $$(1,1) (n, n) $$can enter.
###Output format:
For each group of data, output "lcyyds" in one line. If $$LC $$can walk out of the maze, otherwise output "qwq" without quotation marks.
###Input example:
```in
two
three
0 0 0
1 1 0
1 1 0
three
three
0 0 1
1 1 0
1 1 0
```
###Output example:
```out
LCyyds
QwQ
```
answer：If there is no answer, please comment