#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e9 + 7;
const ll mod = 1e9 + 7;

char mp[15][15];
int flag[15][15];
int ans;
int n;
void dfs1(int a, int b) {
    if (mp[a][b] == '#') return ;
    if (a == n && b == n) {
        ans = 1;
        return ;
    }
    if (ans == 1 || flag[a][b] == 1) return ;

    if (a != 1 || b != 1)flag[a][b] = 1;
    
    dfs1(a + 1, b);
    
    if(ans==1) {//cout<<a<<' '<<b<<'\n';
        if (a != 1 || b != 1)flag[a][b] = 1;
        return;
    }
    dfs1(a, b + 1);
    
    if(ans==1) {//cout<<a<<' '<<b<<'\n';
        if (a != 1 || b != 1)flag[a][b] = 1;
        return;
    }

}
void dfs2(int a, int b) {
    if (mp[a][b] == '#') return ;
    if (a == n && b == n) {
        ans = 1;
        return ;
    }
    if (ans == 1 || flag[a][b] == 1) return ;
    
    dfs2(a, b + 1);
    if(ans){
    //    cout<<a<<' '<<b<<'\n';
        if (a != 1 || b != 1)flag[a][b] = 1;
        return;
    } 
    dfs2(a + 1, b);
    if(ans){
//        cout<<a<<' '<<b<<'\n';
    if (a != 1 || b != 1) flag[a][b] = 1;    return;
    } 

}
int main() {
    int t;
    cin>>t;
    while (t --) {
        string mpp[15];
        for (int i = 0; i <= 14; i++) {
            for (int j = 0; j <= 14; j++) {
                mp[i][j]='#';
                flag[i][j]=0;
            }

        }
        
        cin>>n;
        for (int i = 1; i <= n; i++) {
            cin >> mpp[i];
        }
        
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                mp[i][j] = mpp[i][j - 1];

            }
        }

        ans = 0;
        dfs1(1, 1);
        int an = 0;
        if (ans) an++;
        ans = 0;
        dfs2(1, 1);
        if (ans) an++;
        cout << an << '\n';

    }
    return 0;
}