#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr int N = 301;

int a[N * 2][N * 2], c[N * 2][N * 2];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<pair<int, int>> cows;

    for (int i = 0; i < n; ++i) {
        string s;
        cin >> s;
        for (int j = 0; j < n; ++j) {
            if (s[j] == '*') {
                cows.push_back({i + j, i - j + n});
            }
        }
    }

    int ans = 0;

    for (int t = 0; t < 4; ++t) {
        memset(a, 0, sizeof(a)), memset(c, 0, sizeof(c));
        for (auto &[x, y] : cows) {
            a[x][y] = c[x][y] = 1;
        }
        for (int i = 0; i < 2 * n; ++i) {
            for (int j = 1; j < 2 * n; ++j) {
                a[i][j] += a[i][j - 1];
            }
        }
        for (int len = 1; len <= 2 * (n - 1); ++len) {
            for (auto [x, y] : cows) {
                if (y + len < 2 * n && x - len >= 0) {
                    int now = c[x][y + len] * (a[x - len][y + len - 1] - (y == 0 ? 0 : a[x - len][y - 1]));
                    ans += now;
                }
            }
        }
        for (auto &[x, y] : cows) {
            int i = x, j = y;
            x = j, y = 2 * n - 1 - i;
        }
    }

    cout << ans << '\n';

    return 0;
}