#include <bits/stdc++.h>
#include <cassert>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second

void solve() {
    int n; cin >> n;
    vector<string> s(n);
    for (int i = 0; i < n; i++) cin >> s[i];

    vector<vector<int>> pref_sum(2 * n, vector<int>(n + 1)), pref_diff(2 * n, vector<int>(n + 1));
    for (int sm = 0; sm <= 2 * n - 2; sm++) {
        for (int i = 0; i < n; i++) {
            pref_sum[sm][i + 1] = pref_sum[sm][i];
            if (sm >= i && sm - i < n && s[i][sm - i] == '*') {
                pref_sum[sm][i + 1]++;
            }
        }
    }
    for (int diff = -(n - 1); diff <= (n - 1); diff++) {
        for (int i = 0; i < n; i++) {
            pref_diff[diff + n][i + 1] = pref_diff[diff + n][i];
            if (i - diff >= 0 && i - diff < n && s[i][i - diff] == '*') {
                pref_diff[diff + n][i + 1]++;
            }
        }
    }

    auto get_seg_sum = [&](int sm, int li, int ri) {
        li = max(li, 0);
        ri = min(ri, n - 1);
        return max(0, pref_sum[sm][ri + 1] - pref_sum[sm][li]);
    };
    auto get_seg_diff = [&](int diff, int li, int ri) {
        li = max(li, 0); ri = min(ri, n - 1);
        return max(0, pref_diff[diff][ri + 1] - pref_diff[diff][li]);
    };

    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (s[i][j] == '*') {
                int sm = i + j;
                for (int i1 = 0; i1 < n; i1++) {
                    if (i1 != i && sm - i1 >= 0 && sm - i1 < n && s[i1][sm - i1] == '*') {
                        int dist = abs(i1 - i) * 2;
                        if (sm + dist <= 2 * (n - 1)) {
                            ans += get_seg_sum(sm + dist, max(i, i1), min(i, i1) + dist);
                        }
                        if (sm - dist >= 0) { 
                            ans += get_seg_sum(sm - dist, max(i, i1) - dist, min(i, i1));
                        }
                    }
                }

                int diff = i - j;
                for (int i1 = 0; i1 < n; i1++) {
                    if (i1 - diff >= 0 && i1 - diff < n && i1 != i && s[i1][i1 - diff] == '*') {
                        int dist = 2 * abs(i1 - i);
                        if (diff - dist >= -(n - 1)) {
                            ans += get_seg_diff(diff - dist + n, max(i, i1) - dist + 1, min(i, i1) - 1);
                        }
                        if (diff + dist <= n - 1) {
                            ans += get_seg_diff(diff + dist + n, max(i1, i) + 1, min(i, i1) + dist - 1);
                        }
                    }
                }
            }   
        }
    }

    cout << ans / 2 << '\n';
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else
        ios::sync_with_stdio(false); 
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}