{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eYu Zhou likes to play \u003cb\u003eGo\u003c/b\u003e with Su Lu. From the historical research, we found that there are much difference on the rules between ancient go and modern go.\u003cbr\u003e\u003cbr\u003eHere is the rules for ancient go they were playing:\u003cbr\u003e\u003cbr\u003e$\\cdot$The game is played on a $8×8$ cell board, the chess can be put on the intersection of the board lines, so there are $9×9$ different positions to put the chess.\u003cbr\u003e$\\cdot$Yu Zhou always takes the black and Su Lu the white. They put the chess onto the game board alternately.\u003cbr\u003e$\\cdot$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, this component dies and will be removed from the game board.\u003cbr\u003e$\\cdot$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 the dead components.\u003cbr\u003eOne 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 would like to know whether Yu Zhou has a move to kill at least one of Su Lu\u0027s chess.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line of the input gives the number of test cases, $T(1≤T≤100)$. $T$ test cases follow. Test cases are separated by an empty line. Each test case consist of 9 lines represent the game board. Each line consists of 9 characters. Each character represents a cell on the game board. $\u0027.\u0027$ represents an empty cell. $\u0027x\u0027$ represents a cell with black chess which owned by Yu Zhou. $\u0027o\u0027$ represents a cell with white chess which owned by Su Lu."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output one line containing \u003cb\u003eCase #x: y\u003c/b\u003e, where $x$ is the test case number (starting from 1) and $y$ is \u003cb\u003eCan kill in one move!!!\u003c/b\u003e if Yu Zhou has a move to kill at least one of Su Lu\u0027s components. \u003cb\u003eCan not kill in one move!!!\u003c/b\u003e otherwise."}},{"title":"Sample","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\r\n\r\n.......xo\r\n.........\r\n.........\r\n..x......\r\n.xox....x\r\n.o.o...xo\r\n..o......\r\n.....xxxo\r\n....xooo.\r\n\r\n......ox.\r\n.......o.\r\n...o.....\r\n..o.o....\r\n...o.....\r\n.........\r\n.......o.\r\n...x.....\r\n........o\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: Can kill in one move!!!\r\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":"Hint","value":{"format":"HTML","content":"\u003cbr\u003eIn the first test case, Yu Zhou has 4 different ways to kill Su Lu\u0027s component.\u003cbr\u003e\u003cbr\u003eIn the second test case, there is no way to kill Su Lu\u0027s component.\u003cbr\u003e"}}]}