#include <cstdio>

 #include <cstring>

 const int maxn =  + ;

 char G[maxn][maxn];

 int c[maxn];

 int n;

 bool dfs(int u)

 {

     c[u] = -;

     for(int v = ; v < n; v++) if(G[u][v] == '')

     {

         if(c[v] < ) return false;

         if(!c[v] && !dfs(v)) return false;

     }

     c[u] = ;

     return true;

 }

 bool solve()

 {

     memset(c, , sizeof(c));

     for(int i = ; i < n; i++) if(!c[i])

         if(!dfs(i)) return false;

     return true;

 }

 int main()

 {

     //freopen("in.txt", "r", stdin);

     int T; scanf("%d", &T);

     for(int kase = ; kase <= T; kase++)

     {

         scanf("%d", &n);

         for(int i = ; i < n; i++) scanf("%s", G[i]);

         printf("Case #%d: %s\n", kase, solve() ? "No" : "Yes");

     }

     return ;

 }