{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"Yu Zhou likes to play `Go` with Su Lu. From the historical research, we found that there are much difference on the rules between ancient go and modern go.\n\nHere is the rules for ancient go they were playing:\n* The game is played on a $8\\times 8$ cell board, the chess can be put on the intersection of the board lines, so there are $9\\times 9$ different positions to put the chess.\n* Yu Zhou always takes the black and Su Lu the white. They put the chess onto the game board alternately.\n* The chess of the same color makes connected components(connected by the board lines), for each of the components, if it\u0027s not connected with any of the empty cells,\n\tthis component dies and will be removed from the game board.\n* When one of the player makes his move, check the opponent\u0027s components first. After removing the dead opponent\u0027s components, check with the player\u0027s components and remove\n\tthe dead components.\n\n\nOne day, Yu Zhou was playing ancient go with Su Lu at home. It\u0027s Yu Zhou\u0027s move now. But they had to go for an emergency military action. Little Qiao looked at the game board and\nwould like to know whether Yu Zhou has a move to kill at least one of Su Lu\u0027s chess."}},{"title":"Input","value":{"format":"MD","content":"The first line of the input gives the number of test cases, $T$($1\\leq T\\leq 100$). $T$ test cases follow. Test cases are separated by an empty line. Each test case consist of $9$\nlines represent the game board. Each line consists of $9$ characters. Each character represents a cell on the game board. `.` represents an empty cell. `x` represents a\ncell with black chess which owned by Yu Zhou. `o` represents a cell with white chess which owned by Su Lu."}},{"title":"Output","value":{"format":"MD","content":"For each test case, output one line containing `Case #x: y`, where $x$ is the test case number (starting from $1$) and $y$ is `Can kill in one move!!!` if Yu Zhou\nhas a move to kill at least one of Su Lu\u0027s components. `Can not kill in one move!!!` otherwise."}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\n\n.......xo\n.........\n.........\n..x......\n.xox....x\n.o.o...xo\n..o......\n.....xxxo\n....xooo.\n\n......ox.\n.......o.\n...o.....\n..o.o....\n...o.....\n.........\n.......o.\n...x.....\n........o\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: Can kill in one move!!!\nCase #2: Can not kill in one move!!!\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"MD","content":"In the first test case, Yu Zhou has $4$ different ways to kill Su Lu\u0027s component.\n\nIn the second test case, there is no way to kill Su Lu\u0027s component."}}]}