#include using namespace std; #if __has_include() #include using namespace atcoder; templateistream &operator>>(istream &is,static_modint &a){long long b;is>>b;a=b;return is;} istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;} #endif #ifdef LOCAL #include "debug.h" #else #define debug(...) static_cast(0) #define debugg(...) static_cast(0) templateostream &operator<<(ostream &os,const pair&p){os<; templateusing minque=priority_queue,greater>; templatebool chmax(T &a,const T &b){return (abool chmin(T &a,const T &b){return (a>b?(a=b,true):false);} templateistream &operator>>(istream &is,pair&p){is>>p.first>>p.second;return is;} templateistream &operator>>(istream &is,vector &a){for(auto &i:a)is>>i;return is;} templatevoid operator++(pair&a,int n){a.first++,a.second++;} templatevoid operator--(pair&a,int n){a.first--,a.second--;} templatevoid operator++(vector&a,int n){for(auto &i:a)i++;} templatevoid operator--(vector&a,int n){for(auto &i:a)i--;} #define reps(i,a,n) for(int i=(a);i<(n);i++) #define rep(i,n) reps(i,0,n) #define all(x) x.begin(),x.end() #define pcnt(x) __builtin_popcountll(x) #define fin(x) return cout<(0) ll myceil(ll a,ll b){return (a+b-1)/b;} template auto vec(const int (&d)[n],const T &init=T()){ if constexpr (id(d,init)); else return init; } void SOLVE(); int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout<>testcase; for(int i=0;i>n; vectors(n); cin>>s; int ans=0; rep(i,n){ int a=0,b=0; rep(j,n){ if(s[i][j]=='A')a++; else if(s[i][j]=='B')b++; } ans+=b==0&&a==n-1; } rep(j,n){ int a=0,b=0; rep(i,n){ if(s[i][j]=='A')a++; else if(s[i][j]=='B')b++; } ans+=b==0&&a==n-1; } int a=0,b=0; rep(i,n){ if(s[i][i]=='A')a++; else if(s[i][i]=='B')b++; } ans+=b==0&&a==n-1; a=b=0; rep(i,n){ if(s[i][n-i-1]=='A')a++; else if(s[i][n-i-1]=='B')b++; } ans+=b==0&&a==n-1; cout<