#include<bits/stdc++.h>
#include <atcoder/all>
using namespace std;using namespace atcoder;using vst = vector<string>;using ll = long long;
using ld = long double;using pll = pair<ll,ll>;using vll = vector<ll>;using vvll = vector<vll>;
using vpll = vector<pll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repp(i,k,n) for (ll i = k; i < n; i++)
#define per(i,s,e) for(ll i = s; i >= e; i--)
#define all(v) v.begin(),v.end()
#define _GLIBCXX_DEBUG
#define no() {cout << "No" << endl; return 0;}
#define yes(){cout << "Yes" << endl;return 0;}
#define yesno(a) a ? cout << "Yes" << endl : cout << "No" << endl
#define YESNO(a) a ? cout << "YES" << endl : cout << "NO" << endl
#define MODD 998244353LL
#define MOD 1000000007LL
#define UNOmap unordered_map
#define UNOset unordered_set
#define ASC(T) T,vector<T>,greater<T>
#define join(G,a,b) G[a].push_back(b);G[b].push_back(a);
template<class... T>void in(T&... a){(cin >> ... >> a);}
template<class T, class... Ts>void out(const T& a, const Ts&... b){cout << a;((cout << ' ' <<  b), ...);cout << '\n';}
void vin(vll &v){for(ll i = 0; i < (ll)v.size(); i++)in(v[i]);}
void vout(vll &v){for(ll i = 0; i < (ll)v.size(); i++) cout << v[i] << ' ';}
ll INF = 1LL << 62;

// #include<boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;

// using mint = modint998244353;
// using mint = modint1000000007;
// using mint = modint;


// cout << fixed << setprecision(15);
//----------------------------------------------



int main(){
  ll N;
  in(N);
  ll ans = 0;
  
  vst s(N);
  rep(i,N) in(s[i]);
  
  
  rep(i,N){
    ll cur = 0;
    bool ok = true;
    rep(j,N){
      if(s[i][j] == 'A') cur++;
      if(s[i][j] == 'B')  ok = false;
    }
    if(cur == N-1 and ok)ans++;
  }
  
  rep(j,N){
    ll cur = 0;
    bool ok = true;
    rep(i,N){
      if(s[i][j] == 'A') cur++;
      if(s[i][j] == 'B')ok = false;
    }
    if(cur == N-1 and ok) ans++;
  }
  
  ll p = 0;
  bool flg1 = true;
  rep(i,N){
    if(s[i][i] == 'A') p++;
    if(s[i][i] == 'B')flg1 = false;
  }
  if(p == N-1 and flg1) ans++;
  
  ll q = 0;
  bool flg2 = true;
  rep(i,N){
    if(s[N-i-1][i] == 'A')q++;
    if(s[N-i-1][i] == 'B')flg2 = false;
  }
  if(q == N-1 and flg2)ans++;
  
  out(ans);
}