PROGRAMMING:Simple and easy
This problem requires the realization of a simple Lianliankan game simulation program.
Given a square grid game disk of $$2n / times 2n $, some symbols are placed in each grid. These symbols must appear in pairs, and there may be more than one pair of the same symbol. The program reads a pair of positions given by the player_ 1, y_ 1)$$、$$(x_ 2, y_ 2) To determine whether the symbols in the two positions match. If the matching is successful, the two symbols will be deleted as "*" and the deleted disk will be output; Otherwise, "uh oh" is output. If the match error reaches 3 times, "game over" is output and the game ends. Or when all symbols are successfully matched, the output will be "migrations!", Then end the game.
###Input format:
Enter a positive integer $$n $$($< 5 $$) in one line. The next $$2n $$line, each line of $$2n $$capital letters (separated by a space), represents the game disk. The disk is followed by a positive integer $$k $$, followed by $$k $$lines, each line in the format "$$X"_ 1$$ $$y_ 1$$ $$x_ 2$$ $$y_ 2 $$"gives a player's input. Note that the row and column numbers of the grid are from 1 to $$2n $.
###Output format:
According to the player's input of each step, output the corresponding results. When outputting the disk, note that the characters in each line are separated by one space, and there should be no extra space at the end of the line.
###Input sample 1:
```in
two
I T I T
Y T I A
T A T Y
I K K T
eleven
1 1 1 3
4 2 4 3
3 1 4 2
2 2 1 2
3 1 2 4
4 4 3 1
2 1 3 4
3 3 1 4
4 1 2 3
2 4 3 2
1 1 2 2
```
###Output sample 1:
```out
* T * T
Y T I A
T A T Y
I K K T
* T * T
Y T I A
T A T Y
I * * T
Uh-oh
* * * T
Y * I A
T A T Y
I * * T
Uh-oh
* * * T
Y * I A
* A T Y
I * * *
* * * T
* * I A
* A T *
I * * *
* * * *
* * I A
* A * *
I * * *
* * * *
* * * A
* A * *
* * * *
Congratulations!
```
###Input example 2:
```
two
I T I T
Y T I A
T A T Y
I K K T
five
1 1 4 4
1 1 2 3
1 1 2 3
2 2 4 1
2 2 3 3
```
###Output example 2:
```
Uh-oh
* T I T
Y T * A
T A T Y
I K K T
Uh-oh
Uh-oh
Game Over
```
answer：If there is no answer, please comment
Given a square grid game disk of $$2n / times 2n $, some symbols are placed in each grid. These symbols must appear in pairs, and there may be more than one pair of the same symbol. The program reads a pair of positions given by the player_ 1, y_ 1)$$、$$(x_ 2, y_ 2) To determine whether the symbols in the two positions match. If the matching is successful, the two symbols will be deleted as "*" and the deleted disk will be output; Otherwise, "uh oh" is output. If the match error reaches 3 times, "game over" is output and the game ends. Or when all symbols are successfully matched, the output will be "migrations!", Then end the game.
###Input format:
Enter a positive integer $$n $$($< 5 $$) in one line. The next $$2n $$line, each line of $$2n $$capital letters (separated by a space), represents the game disk. The disk is followed by a positive integer $$k $$, followed by $$k $$lines, each line in the format "$$X"_ 1$$ $$y_ 1$$ $$x_ 2$$ $$y_ 2 $$"gives a player's input. Note that the row and column numbers of the grid are from 1 to $$2n $.
###Output format:
According to the player's input of each step, output the corresponding results. When outputting the disk, note that the characters in each line are separated by one space, and there should be no extra space at the end of the line.
###Input sample 1:
```in
two
I T I T
Y T I A
T A T Y
I K K T
eleven
1 1 1 3
4 2 4 3
3 1 4 2
2 2 1 2
3 1 2 4
4 4 3 1
2 1 3 4
3 3 1 4
4 1 2 3
2 4 3 2
1 1 2 2
```
###Output sample 1:
```out
* T * T
Y T I A
T A T Y
I K K T
* T * T
Y T I A
T A T Y
I * * T
Uh-oh
* * * T
Y * I A
T A T Y
I * * T
Uh-oh
* * * T
Y * I A
* A T Y
I * * *
* * * T
* * I A
* A T *
I * * *
* * * *
* * I A
* A * *
I * * *
* * * *
* * * A
* A * *
* * * *
Congratulations!
```
###Input example 2:
```
two
I T I T
Y T I A
T A T Y
I K K T
five
1 1 4 4
1 1 2 3
1 1 2 3
2 2 4 1
2 2 3 3
```
###Output example 2:
```
Uh-oh
* T I T
Y T * A
T A T Y
I K K T
Uh-oh
Uh-oh
Game Over
```
answer：If there is no answer, please comment