#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
void die(string S){puts(S.c_str());exit(0);}
string G[15];
int n;
bool dfs(int x,int y)
{
    if(G[x][y]=='#')
        return false;
    if(x==n-1&&y==n-1)
        return true;
    if(x>=n||y>=n)
        return false;
    if(x+y)
        G[x][y]='#';
    if(dfs(x,y+1))
        return true;
    else    return dfs(x+1,y);
}
void solve()
{
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>G[i];
    int x=0;
    while(dfs(0,0))
        x++;
    cout<<x<<endl;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
        solve();
    return 0;
}