#include<bits/stdc++.h>

#define gcd(a,b) __gcd(a,b)
#define mod 1000000007
#define INF 0x3f3f3f3f3f
#define eps 1e-6    
#define pb push_back
#define rep(i,x,y) for(int i=x;i<y;i++)
#define mem(a,x) memset(a,x,sizeof(a))
#define IOS cin.tie(0), ios::sync_with_stdio(false)
#define maxn 100005
typedef long long ll; 
#define pll pair<ll,ll>
using namespace std;
bool vis[15][15];
char maze[15][15];
int ans,n;
bool check(int x, int y){
    if(x==n-1&&y==n-1) return true;
    if(x>=n||y>=n||vis[x][y]==true) return false;
    else return true;
}
bool dfs(int x, int y){
    if(ans==2) return true;
    if(x==n-1&&y==n-1){
        ans++;
        return true;
    }
    // cout<<"x"<<x<<"y"<<y<<endl;
    int nx=x+1;
    int ny=y;
    if(check(nx,ny)){
        vis[nx][ny]=true; 
        if(dfs(nx,ny)&&(x!=0||y!=0)) 
            return true;
    }
    nx=x;
    ny=y+1;
    if(check(nx,ny)){
        vis[nx][ny]=true; 
        if(dfs(nx,ny)&&(x!=0||y!=0)) 
            return true;
    }
    return false;
}
void solve(){
    cin>>n;
    rep(i,0,n){
        rep(j,0,n){
            cin>>maze[i][j];
            if(maze[i][j]=='#') vis[i][j]=true;
            else vis[i][j]=false;
        }
    }
    ans=0;
    if(maze[0][0]=='#'||maze[n-1][n-1]=='#') ans=0;
    else dfs(0,0);
    cout<<ans<<endl;
}
int main(){
    int T;
    cin>>T;
    while(T--){
        solve();
    } 
}