#include<bits/stdc++.h>
using namespace std;
const int N=15;
string str[15];
int vis[N][N];
int ans=0;
int n;
int x[3]={1,0},y[3]={0,1};
bool dfs(int x,int y){
    //cout<<x<<" "<<y<<endl;
    
    if(x==n-1&&y==n-1){
        ans++;
        return true;
    }
    if(vis[x][y])return false;
    
    
    if(!vis[x+1][y]&&str[x+1][y]=='.'&&x+1<n){   
        if(dfs(x+1,y)){
            vis[x][y]=1;
            return true;
        }
    }
    if(!vis[x][y+1]&&str[x][y+1]=='.'&&y+1<n){
        if(dfs(x,y+1)){
            vis[x][y]=1;
            return true;
        }
        
    }
    return false;
}
int main(){
    int t;
    cin>>t;
    while(t--){
        cin>>n;
        memset(vis,0,sizeof vis);
        for(int i=0;i<n;i++){
            cin>>str[i];
        }
        ans=0;
        if(str[0][0]=='#'||str[n-1][n-1]=='#'){
            cout<<0<<endl;
            continue;
        }
        dfs(0,0);
        vis[0][0]=0;
        dfs(0,0);
        cout<<ans<<endl;
    }
}