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

#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
const int N = 2e6 + 10;
const int mod = 1e9 + 7;

char mp[20][20];
int n;
bool dfs(int i, int j) {
    if(i == n && j == n) return true;

    if(i > n || j > n || mp[i][j] == '#') return false;
    if(dfs(i, j + 1)) {
        mp[i][j + 1] = '#';
        return true;
    }
    if(dfs(i + 1, j)) {
        mp[i + 1][j] = '#';
        return true;
    }
    return false;
}
int main() {
    int t;
    cin >> t;
    while(t--) {
        cin >> n;
        for(int i = 1; i <= n; i++) {
            scanf("%s", mp[i] + 1);
        }
        int ans = 0;
        if(mp[1][1] == '#' || mp[n][n] == '#') ans = 0;

        else ans += dfs(1, 1) + dfs(1, 1);
        //for(int i=1;i<=n;i++) cout<<(mp[i]+1)<<endl;
        cout << ans << endl;
    }
}