#include <stdio.h>//#include <bits/stdc++.h>
#include <math.h>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstdio>
#define  MAX(x,y) (((x)>(y)) ? (x) : (y))
#define  MIN(x,y) (((x)<(y)) ? (x) : (y))
#define  sq(x) (x)*(x)
#define  cei(a,b) (long long)(((a)+(b)-1)/(b))
#define  mst(a,b) memset((a),b,sizeof((a)))
#define  fi first
#define  se second
#define  pb push_back
using namespace std;
const int MAXN = 1e6+5;
const int N=1e5+5;
const int E4=1e4;
//const long long mod = 1e9+7 ;
//const long long mod = 998244353 ;
const int inf = 0x3f3f3f3f;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int dx[4]= {1,0,0,-1};
int dy[4]= {0,-1,1,0};
int n,m,k;
char s[15][15];
int cnt[15][15]= {0};
int dfs(int x,int y)
{
    if(s[x][y]=='#')return 0;
    if(x==n-1&&y==n-1)return 1;
    if(x>=n||y>=n)return 0;
    return dfs(x,y+1)||dfs(x+1,y);
}
void solve()
{
    scanf("%d",&n);
    for(int i=0; i<n; i++)
        scanf("%s",s[i]);
    int ans=0;
    ans+=dfs(0,1);
    ans+=dfs(1,0);
    if(s[0][0]=='#')ans=0;
    int flag=1;
    if(ans==2) {
        for(int i=0; i<n&&flag; i++) {
            for(int j=0; j<n&&flag; j++) {
                if(i==0&&j==0)continue;
                if(i==n-1&&j==n-1)continue;
                if(s[i][j]=='#')continue;
                s[i][j]='#';
                flag=dfs(0,0);
                s[i][j]='.';
            }
        }
    }
    if(!flag)ans--;
    printf("%d\n",ans);
}
int main()
{
//    freopen("D:\\desktop\\in.txt","r",stdin);
//    freopen("D:\\desktop\\out2.txt","w",stdout);
    int T=1;
    scanf("%d",&T);
    for(int i=1; i<=T; i++) {
//        printf("Case %d:\n",i);

        solve();

    }
    return 0;
}