PROGRAMMING:Lighting New World
*Super Brain* is a famous scientific reality and talent show aiming to find people with exceptional brainpower.
In one of the challenges called *Lighting New World*, maybe you have to understand the small world network rules first. The flight railways and network lines around us all follow the rules of the small world network, and are connected to each other. The intersection in the connection is the core node, also known as the hub. The rules of the small world network make our world more efficient.
At this time, the program put the rules of the small world network on the stage and designed a beautiful array of lights.

The light array is designed according to the laws of the small world of the network. There are $$n$$ lights (numbered from 1 to $$n$$) that are randomly associated with each other. Each light has an internal network connection with the surrounding lights. The two contestants will observe the network password figure of $$n$$ lights for a limited ti me, and deduce the network connection between the lights in their minds.
During the competition, the two contestants will turn on one of the unlit lights in one's turn, and all the lights associated with the first-level and second-level lights of this light will also be lit or changed to the same color at the same time. The lamp lighted by the person who lighting the lamp first is red, and by the second person is blue. There are $$m$$ rounds in the competition, each time the lighting operation is limited to 30 seconds. If all lights are turned on before the end of all rounds, the game ends in advance.

Now given the total number $$n$$ of all the lights, the number of competition round $$m$$ that two contestants will play, all the first-level relationship of each light, and the number of the light that two contestants want to turn on.
As a technical staff of the show, you are required to write a program and simulate the process of the game.
### Input Specification:
Each input file only contains one test case.
Each case starts with one positive integer $$n$$ (<=1000) which is the total number of lights in the game. Then $$n$$ lines follow, the $$i$$-th line contains the information of the first-level relationship of each light in the following format:
`K ID[1] ID[2] ... ID[K]`
where $$K$$ (0<=$$K$$<=10) is the total number of first-level relationship of $$i$$-th light, followed by a sequence of all the ID's of first-level lights. All the numbers in a line are separated by a space.
After that, followed by one positive integer $$m$$ (<=1000) which is the total number of rounds in the game. Then $$m$$ lines follow, the $$i$$-th line contains two integers $$p$$, $$q$$, indicating in the $$i$$-th round, the light number chosen by the first hand player and the second hand player.
### Output Specification:
First and foremost, you should print "Round #X"(without quotes) at the beginning of each of the $$m$$ rounds.
Then, for every move operated by each contestant, you should print two lines:
In the first line, if the selected light by the contestant has not been lit, print "X red/blue light(s) on, Y blue/red light(s) off." (without quotes), indicating the current result after each contestant's operation. If there is not exist any rival's light turned off, just print "X red/blue light(s) on." (without quotes). Otherwise, print "Light X has been lit." (without quotes).
In the second line, print "Current score: R:B" (without quotes), indicating the current score after each contestant's operation.
Finally, if all lights are turned on or all rounds are operated, the game is over, and you also should print two lines:
In the first line, print "Game over!" ( without quotes).
In the second line, print "Final score: R:B" (without quotes), indicating the final score when the game ends.
### Sample Input:
```in
ten
1 3
3 1 5 9
2 4 5
0
2 6 9
3 2 8 9
3 4 6 8
2 3 4
1 1
0
five
2 7
6 10
3 5
9 4
1 8
```
### Sample Output:
```out
Round #1
6 red light(s) on.
Current score: 6:0
7 blue light(s) on, 4 red light(s) off.
Current score: 2:7
Round #2
Light 6 has been lit.
Current score: 2:7
1 blue light(s) on.
Current score: 2:8
Game over!
Final score: 2:8
```
answer:If there is no answer, please comment
In one of the challenges called *Lighting New World*, maybe you have to understand the small world network rules first. The flight railways and network lines around us all follow the rules of the small world network, and are connected to each other. The intersection in the connection is the core node, also known as the hub. The rules of the small world network make our world more efficient.
At this time, the program put the rules of the small world network on the stage and designed a beautiful array of lights.

The light array is designed according to the laws of the small world of the network. There are $$n$$ lights (numbered from 1 to $$n$$) that are randomly associated with each other. Each light has an internal network connection with the surrounding lights. The two contestants will observe the network password figure of $$n$$ lights for a limited ti me, and deduce the network connection between the lights in their minds.
During the competition, the two contestants will turn on one of the unlit lights in one's turn, and all the lights associated with the first-level and second-level lights of this light will also be lit or changed to the same color at the same time. The lamp lighted by the person who lighting the lamp first is red, and by the second person is blue. There are $$m$$ rounds in the competition, each time the lighting operation is limited to 30 seconds. If all lights are turned on before the end of all rounds, the game ends in advance.

Now given the total number $$n$$ of all the lights, the number of competition round $$m$$ that two contestants will play, all the first-level relationship of each light, and the number of the light that two contestants want to turn on.
As a technical staff of the show, you are required to write a program and simulate the process of the game.
### Input Specification:
Each input file only contains one test case.
Each case starts with one positive integer $$n$$ (<=1000) which is the total number of lights in the game. Then $$n$$ lines follow, the $$i$$-th line contains the information of the first-level relationship of each light in the following format:
`K ID[1] ID[2] ... ID[K]`
where $$K$$ (0<=$$K$$<=10) is the total number of first-level relationship of $$i$$-th light, followed by a sequence of all the ID's of first-level lights. All the numbers in a line are separated by a space.
After that, followed by one positive integer $$m$$ (<=1000) which is the total number of rounds in the game. Then $$m$$ lines follow, the $$i$$-th line contains two integers $$p$$, $$q$$, indicating in the $$i$$-th round, the light number chosen by the first hand player and the second hand player.
### Output Specification:
First and foremost, you should print "Round #X"(without quotes) at the beginning of each of the $$m$$ rounds.
Then, for every move operated by each contestant, you should print two lines:
In the first line, if the selected light by the contestant has not been lit, print "X red/blue light(s) on, Y blue/red light(s) off." (without quotes), indicating the current result after each contestant's operation. If there is not exist any rival's light turned off, just print "X red/blue light(s) on." (without quotes). Otherwise, print "Light X has been lit." (without quotes).
In the second line, print "Current score: R:B" (without quotes), indicating the current score after each contestant's operation.
Finally, if all lights are turned on or all rounds are operated, the game is over, and you also should print two lines:
In the first line, print "Game over!" ( without quotes).
In the second line, print "Final score: R:B" (without quotes), indicating the final score when the game ends.
### Sample Input:
```in
ten
1 3
3 1 5 9
2 4 5
0
2 6 9
3 2 8 9
3 4 6 8
2 3 4
1 1
0
five
2 7
6 10
3 5
9 4
1 8
```
### Sample Output:
```out
Round #1
6 red light(s) on.
Current score: 6:0
7 blue light(s) on, 4 red light(s) off.
Current score: 2:7
Round #2
Light 6 has been lit.
Current score: 2:7
1 blue light(s) on.
Current score: 2:8
Game over!
Final score: 2:8
```
answer:If there is no answer, please comment