#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<bitset>

 #include<cassert>

 #include<cctype>

 #include<cmath>

 #include<cstdlib>

 #include<ctime>

 #include<deque>

 #include<iomanip>

 #include<list>

 #include<map>

 #include<queue>

 #include<set>

 #include<stack>

 #include<vector>

 using namespace std;

 typedef long long ll;

 const double pi = acos(-1.0);

 const ll mod = 1e9 + ;

 const int inf = 0x3f3f3f3f;

 const int maxn = 5e4 + ;

 int Next[][] = {{, }, {, }, {-, }, {, -}};

 char str[][];

 int vis[][];

 bool check1(int x, int y)

 {

     vis[x][y] = ;

     for(int i=;i<;i++)

     {

         int xx = x + Next[i][];

         int yy = y + Next[i][];

         if(xx >=  && xx <  && yy >=  && yy <  && !vis[xx][yy])

         {

             /* 两种情况表示在已经换了一个的情况下,还没有封死*/

             if(str[xx][yy] == '.') return true;

             if(str[xx][yy] == 'o' && check1(xx, yy)) return true;

         }

     }

     return false;

 }

 bool check(int x, int y)

 {

     str[x][y] = 'x';///把点换为‘x'

     bool flag= false;

     for(int i=;i<;i++)

     {

         int xx = x + Next[i][];

         int yy = y + Next[i][];

         if(xx >=  && xx <  && yy >=  && yy < )

         {

             if(str[xx][yy] == 'o')

             {

                 memset(vis, , sizeof(vis));

                 if(!check1(xx, yy))///检查此'o'是否被封死

                 {

                     flag = true;

                     break;

                 }

             }

         }

     }

     str[x][y] = '.';///取消改换

     return flag;

 }

 int main()

 {

     int t;

     cin >> t;

     int k = ;

     while(t--)

     {

         for(int i=;i<;i++)

         {

             cin >> str[i];

         }

         bool flag = false;

         for(int i=;i<;i++)

         {

             for(int j=;j<;j++)

             {

                 if(str[i][j] == 'x' || str[i][j] == 'o') continue;

                 else

                 {

                     if(check(i, j))///检查是否有o的周围再加一个x可以被封死

                     {

                         flag = true;

                         break;

                     }

                 }

             }

             if(flag) break;

         }

         cout << "Case #" << k++ << ": ";

         if(flag) cout << "Can kill in one move!!!" << endl;

         else cout << "Can not kill in one move!!!" << endl;

     }

     return ;

 }