#include <bits/stdc++.h>
#define N 12
using namespace std;
int T;
int n;
char ch;
bool g[N][N];
int ans;
bool dfs(int x, int y) {
    if (x < 1 || y < 1 || x > n || y > n) return false;
    if (!g[x][y]) return false;
    if (x == n && y == n) return true;
    g[x][y] = false;
    if (dfs(x + 1, y)) {
        return true;
    }
    if (dfs(x, y + 1)) {
        return true;
    }
    return false;
}
void solve() {
    memset(g, false, sizeof(g));
    ans = 0;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            scanf(" %c", &ch);
            if (ch == '.') {
                g[i][j] = true;
            }
        }
    }
    while (dfs(1, 1)) {
        ++ans;
        g[1][1] = true;
    }
    printf("%d\n", ans);
}
int main() {
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}