#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n;
  cin >> n;
  vector<string> s(n);
  rep(i, n) cin >> s[i];
  vector a(n, vector<ll>(n, 0));
  rep(i, n) rep(j, n) {
    if (s[i][j] == 'A')
      a[i][j] = 1;
    else if (s[i][j] == 'B')
      a[i][j] = -1;
  }
  ll ans = 0;
  rep(i, n) {
    ll now = 0;
    rep(j, n) now += a[i][j];
    ans += now == n - 1;
  }
  rep(j, n) {
    ll now = 0;
    rep(i, n) now += a[i][j];
    ans += now == n - 1;
  }
  {
    ll now = 0;
    rep(i, n) now += a[i][i];
    ans += now == n - 1;
  }
  {
    ll now = 0;
    rep(i, n) now += a[i][n - i - 1];
    ans += now == n - 1;
  }
  cout << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}