/*
    Author: Zhikun Wang
*/
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<'='<<x<<endl

using namespace std;
template<typename T> void read(T &x){
    x = 0;int f = 1;char ch = getchar();
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch = getchar();}
    while(isdigit(ch)){x = x*10+ch-48; ch = getchar();}x*=f;
}
template<typename T, typename ... Args> void read(T &x,Args&... nxt){
    read(x);
    read(nxt...);
}

#define rep(i,a,b) for(int i=a;i<(b);++i)
#define all(x) begin(x),end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;

int T;

char cmp[11][11];
int n;
int cvis[11][11],tvis[11][11];
vector<pii> V2,V;

void dfs(int x,int y){
    if(x == n-1 && y == n-1)V = V2;
    cvis[x][y] = 1;
    V2.push_back(make_pair(x,y));
    if(x<n-1 && !cvis[x+1][y])dfs(x+1,y);
    if(y<n-1 && !cvis[x][y+1])dfs(x,y+1);
    V2.pop_back();
}

bool findroute(){
    memcpy(cvis,tvis,sizeof(tvis));
    dfs(0,0);
    if(V.size()){
        for(auto ct:V){
            tvis[ct.first][ct.second] = 1;
        }
        V.clear();
        return true;
    }
    return false;
}

void solve(){
    read(n);
    memset(tvis,0,sizeof(tvis));
    for(int i=0;i<n;i++)cin>>cmp[i];
    for(int i=0;i<n;i++)for(int j=0;j<n;j++)tvis[i][j] = (cmp[i][j] == '#');
    
    if(tvis[0][0] || tvis[n-1][n-1]){
        cout<<"0\n";
        return;
    }
    int ans = 0;
    while(findroute())ans+=1;
    cout<<ans<<'\n';
}

int main(){
    read(T);
    while(T--){
        solve();
    }
    return 0;
}