#include<stdio.h>

 #include<string.h>

 const int N = ;

 int vis1[N][N],map[N][N],vis[N][N];

 void dfs1(int x,int y)//搜索四个方向

 {

     if (!map[x][y]||vis1[x][y])

         return ;

     vis1[x][y] = ;

     dfs1(x-,y);

     dfs1(x+,y);

     dfs1(x,y-);

     dfs1(x,y+);

 }

 void dfs(int x,int y)//搜索八个方向

 {

     if(!map[x][y]||vis[x][y])

         return ;

     vis[x][y] =;

     dfs(x-,y-);dfs(x-,y);dfs(x-,y+);

     dfs(x,y-);             dfs(x,y+);

     dfs(x+,y-);dfs(x+,y);dfs(x+,y+);

 }

 int main()

 {

     int n,i,j,o = ;

     char s[N];

     while(~scanf("%d",&n)&&n)

     {

         ++o;

         int cnt1 = ;

         int cnt2 = ;

         memset(vis1,,sizeof(vis));

         memset(vis,,sizeof(vis));

         memset(map,,sizeof(map));

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

         {

             scanf("%s",s);

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

             {

                 map[i+][j+] = s[j]-'';//在图周围加一圈空格，防止判断时越界

             }

         }

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

         {

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

             {

                 if (map[i][j]&&!vis1[i][j])

                 {

                     cnt1++;

                     dfs1(i,j);

                 }

                 if (map[i][j]&&!vis[i][j])

                 {

                     cnt2++;

                     dfs(i,j);

                 }

             }

         }

         printf("Case %d: %d %d\n\n",o,cnt1,cnt2);

     }

     return ;

 }