#include<bits/stdc++.h>usingnamespacestd;boolok;charmaze[15][15];charMap[12][12];boolvis[15][15];intx[4]={0,0,1,-1};inty[4]={1,-1,0,0};structST{intii;intjj;};queue<ST>que;voidBFS(intcur_i,intcur_j){intdot=0;while(!que.empty())que.pop();STnow;now.ii=cur_i;now.jj=cur_j;que.push(now);while(!que.empty()){now=que.front();que.pop();vis[now.ii][now.jj]=1;for(inti=0;i<4;i++){inttempX=now.ii+x[i];inttempY=now.jj+y[i];STNext;Next.ii=tempX;Next.jj=tempY;if(tempX>=0&&tempX<=10&&tempY>=0&&tempY<=10&&!vis[tempX][tempY]){if(Map[tempX][tempY]=='.'){dot++;vis[tempX][tempY]=1;}elseif(Map[tempX][tempY]=='o'){que.push(Next);vis[tempX][tempY]=1;}}}}if(dot==1){ok=1;}return;}intmain(){intt;cin>>t;intkase=1;while(t--){ok=0;for(inti=0;i<=8;i++)cin>>maze[i];for(inti=0;i<=10;i++){for(intj=0;j<=10;j++){if(i==0||j==0||i==10||j==10)Map[i][j]='x';elseMap[i][j]=maze[i-1][j-1];}}memset(vis,0,sizeof(vis));for(inti=1;i<=9;i++){for(intj=1;j<=9;j++){if(Map[i][j]=='o'&&!vis[i][j])BFS(i,j);for(intii=1;ii<=9;ii++)for(intjj=1;jj<=9;jj++)if(Map[ii][jj]=='.')vis[ii][jj]=0;if(ok)gotohere;}}here:;if(ok)printf("Case#%d:Cankillinonemove!!!\n",kase++);elseprintf("Case#%d:Cannotkillinonemove!!!\n",kase++);//cout<<endl;}return0;}