#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
const int maxn = 205;
const int INF = 0x3fffffff;
struct Edge {
    int from, to, cap, flow;
};
struct Dinic {
    int n, m, s, t;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool vis[maxn];
    int d[maxn], cur[maxn];
    void init() {
        for (int i = 0; i < maxn; i++) G[i].clear();
        edges.clear();
    }
    void add_edge(int from, int to, int cap) {
        edges.push_back({from, to, cap, 0});
        edges.push_back({to, from, 0, 0});
        m = edges.size();
        G[from].push_back(m - 2);
        G[to].push_back(m - 1);
    }
    bool BFS() {
        memset(vis, 0, sizeof(vis));
        queue<int> Q;
        Q.push(s);
        d[s] = 0;
        vis[s] = 1;
        while (!Q.empty()) {
            int x = Q.front();
            Q.pop();
            for (int i = 0; i < G[x].size(); i++) {
                Edge& e = edges[G[x][i]];
                if (!vis[e.to] && e.cap > e.flow) {
                    vis[e.to] = 1;
                    d[e.to] = d[x] + 1;
                    Q.push(e.to);
                }
            }
        }
        return vis[t];
    }
    int DFS(int x, int a) {
        if (x == t || a == 0) return a;
        int flow = 0, f;
        for (int& i = cur[x]; i < G[x].size(); i++) {
            Edge& e = edges[G[x][i]];
            if (d[x] + 1 == d[e.to] &&
                (f = DFS(e.to, min(a, e.cap - e.flow))) > 0) {
                e.flow += f;
                flow += f;
                edges[G[x][i] ^ 1].flow -= f;
                a -= f;
                if (a == 0) break;
            }
        }
        return flow;
    }
    int Maxflow(int s, int t) {
        this->s = s, this->t = t;
        int flow = 0;
        while (BFS()) {
            memset(cur, 0, sizeof(cur));
            flow += DFS(s, INF);
        }
        return flow;
    }
} dinic;
char str[15][15];
void solve() {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) scanf("%s", str[i]);
    dinic.init();
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (str[i][j] == '.') {
                if ((i != 0 || j != 0) && (i != n - 1 || j != n - 1)) {
                    dinic.add_edge(n * i + j, n * i + j + n * n, 1);
                } else {
                    dinic.add_edge(n * i + j, n * i + j + n * n, INF);
                }
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i != n - 1)
                dinic.add_edge(n * i + j + n * n, n * (i + 1) + j, 1);
            if (j != n - 1) dinic.add_edge(n * i + j + n * n, n * i + j + 1, 1);
        }
    }
    int res = dinic.Maxflow(0, 2 * n * n - 1);
    printf("%d\n", res);
}
int main() {
    int T;
    scanf("%d", &T);
    while (T--) solve();
    return 0;
}