#include<bits/stdc++.h>
using namespace std;

int cnt[11][11],t,n;
bool bo[11][11];
char s[110];

inline int rd()
{
    int x=0;char ch=getchar();
    for (;ch<'0'||ch>'9';ch=getchar());
    for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
    return x;
}

int main()
{
    t=rd();
    while (t--)
    {
        n=rd();
        for (int i=1;i<=n;i++)
        {
            scanf("%s",s+1);
            for (int j=1;j<=n;j++) bo[i][j]=(s[j]=='.');
        }
        for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) if (bo[i][j])
        {
            if (i>1||j>1) bo[i][j]=bo[i-1][j]|bo[i][j-1];
        }
        if (!bo[n][n]) { puts("0");continue; }
        memset(cnt,0,sizeof(cnt));
        int h1=n,h2=n;
        while (h1>1||h2>1)
        {
            if (bo[h1-1][h2]) h1--;
            else h2--;
            if (h1!=1||h2!=1) cnt[h1][h2]++;
        }
        h1=n,h2=n;
        while (h1>1||h2>1)
        {
            if (bo[h1][h2-1]) h2--;
            else h1--;
            if (h1!=1||h2!=1) cnt[h1][h2]++;
        }
        bool flag=true;
        for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) if (cnt[i][j]>1) flag=false;
        if (flag) puts("2");
        else puts("1");
    }
    return 0;
}