#include<iostream>

#include<algorithm>

#include<cstdio>

#include<cstring>

#define maxn 100500

using namespace std;

struct Edge

{

    int next;

    int to;

    int fa;

    int w;

}edge[maxn];

char s[60][60];

int t,n;

int cnt;

int visit[maxn];

int head[maxn];

int match[maxn];

void add(int u,int v)

{

    edge[cnt].next=head[u];

    edge[cnt].to=v;

    head[u]=cnt++;

}

bool dfs(int u)

{

    for(int i=head[u];i!=-1;i=edge[i].next)

    {

        int v=edge[i].to;

        if(!visit[v])

        {

            visit[v]=1;

            if(match[v]==-1||dfs(match[v]))

            {

                match[v]=u;return 1;

            }

        }

    }

    return 0;

}

int main()

{

    int tt=0;

    cin>>t;

    while(t--)

    {

        tt++;

        memset(head,-1,sizeof(head));

        cnt=0;

        cin>>n;

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

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

            cin>>s[i][j];

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

        {

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

            {

                if(s[i][j]=='#'&&s[i][j+1]=='#')

                {

                   // cout<<j+(i-1)*n<<" "<<j+(i-1)*n+1<<endl;

                    add(j+(i-1)*n,j+(i-1)*n+1);

                    add(j+(i-1)*n+1,j+(i-1)*n);

                }

            }

        }

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

        {

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

            {

                if(s[i][j]=='#'&&s[i+1][j]=='#')

                {

                   // cout<<j+(i-1)*n<<" "<<j+(i-1)*n+n<<endl;

                    add(j+(i-1)*n,j+(i-1)*n+n);

                    add(j+(i-1)*n+n,j+(i-1)*n);

                }

            }

        }

        int ans=0;

        memset(match,-1,sizeof(match));

        for(int i=1;i<=n*n;i++)

        {

            memset(visit,0,sizeof(visit));

            if(dfs(i))

                ans++;

        }

         cout<<"Case "<<tt<<": "<<ans/2<<endl;

    }

}