#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int maxn = 0 + 70;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
const double eps = 1e-7;
const double PI = acos(-1.0);

int n, m, k;

char G[maxn][maxn];

bool dfs(int x, int y){
    if(G[x][y] != '.') return false;
    if(x == n-1 && y == n-1) return true;

    G[x][y] = '*';
    if(y < n-1 && dfs(x, y+1)) return true;
    if(x < n-1 && dfs(x+1, y)) return true;
    G[x][y] = '.';
    return false;
}

int main(){
    //freopen("in.txt", "r", stdin);
    int T; cin >> T;
    while(T--){
        scanf("%d",&n);
        for(int i=0;i<n;i++) scanf("%s",G[i]);
        bool flag = dfs(0, 0);
        //cout << "flag: " << flag << endl; for(int i=0;i<n;i++) printf("%s\n",G[i]);
        if(!flag) printf("0\n");
        else{
            G[0][0] = '.';
            flag = dfs(0, 0);
            //cout << "flag: " << flag << endl; for(int i=0;i<n;i++) printf("%s\n",G[i]);
            if(!flag) printf("1\n");
            else printf("2\n");
        }
    }
    return 0;
}