#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod1=1e9+7;
const int Mod2=1e9+9;
int T,n,m,f[12][12];
char s[12][12];

int Calc(int a,int b,int c,int d){
    memset(f,0,sizeof(f));
    for (int i=a;i<=c;++i) 
        for (int j=b;j<=d;++j) 
            if (s[i][j]=='.'){
                if (i==a&&j==b)f[i][j]=1;
                else f[i][j]=(f[i-1][j]+f[i][j-1])%Mod2;
            }
    return f[c][d];
}
int calc(int a,int b,int c,int d){
    memset(f,0,sizeof(f));
    for (int i=a;i<=c;++i) 
        for (int j=b;j<=d;++j) 
            if (s[i][j]=='.'){
                if (i==a&&j==b)f[i][j]=1;
                else f[i][j]=(f[i-1][j]+f[i][j-1])%Mod1;
            }
    return f[c][d];
}
int main(){
    scanf("%d",&T);
    while (T--){
        scanf("%d",&n); m=n;
        for (int i=1;i<=n;++i) scanf("%s",s[i]+1);
        ll t=Calc(1,1,n,m)+calc(1,1,n,m);
        if (!t){ puts("0"); continue;}
        
        ll t1=calc(1,2,n-1,m),t2=calc(2,1,n,m-1);
        ll t3=calc(1,2,n,m-1),t4=calc(2,1,n-1,m);
        ll T1=Calc(1,2,n-1,m),T2=Calc(2,1,n,m-1);
        ll T3=Calc(1,2,n,m-1),T4=Calc(2,1,n-1,m);
        if ((t1*t2%Mod1-t3*t4%Mod1+Mod1)%Mod1||(T1*T2%Mod2-T3*T4%Mod2+Mod2)%Mod2) puts("2");
        else puts("1");
    }
    return 0;
}