#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

#define yn(pope) (pope ? "Yes" : "No")

#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n); i > m; i--)

#define IINF (1 << 30)
#define INF (1ll << 60)

#define all(v) v.begin(), v.end()

int main() {
  int N;
  cin >> N;

  vector M(N, vector(N, '.'));

  rep(i, 0, N) {
    rep(j, 0, N) { cin >> M[j][i]; }
  }

  auto hori = [&]() -> int {
    int count = 0;

    rep(i, 0, N) {
      int c = 0;

      rep(j, 0, N) {
        if (M[j][i] == 'A') { c++; }
      }

      count += (c == N);
    }

    return count;
  };

  auto vert = [&]() -> int {
    int count = 0;

    rep(j, 0, N) {
      int c = 0;

      rep(i, 0, N) {
        if (M[j][i] == 'A') { c++; }
      }

      count += (c == N);
    }

    return count;
  };

  auto diag = [&]() -> int {
    int count = 0, c = 0;

    rep(i, 0, N) {
      if (M[i][i] == 'A') { c++; }
    }

    count += (c == N);

    c = 0;

    rep(i, 0, N) {
      if (M[N - 1 - i][i] == 'A') { c++; }
    }

    count += (c == N);

    return count;
  };

  int ans = 0;

  rep(i, 0, N) {
    rep(j, 0, N) {
      if (M[j][i] != '.') { continue; }

      M[j][i] = 'A';
      ans += (hori() + vert() + diag());
      M[j][i] = '.';
    }
  }

  cout << ans << endl;

  return 0;
}