#include #include #define rep(i,n) for(int i=0;i vi; typedef vector vl; typedef vector> vvi; typedef vector> vvl; typedef long double ld; typedef pair P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template ostream& operator<<(ostream& os, const static_modint& a) {os << a.val(); return os;} template ostream& operator<<(ostream& os, const dynamic_modint& a) {os << a.val(); return os;} template istream& operator>>(istream& is, vector& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template ostream& operator<<(ostream& os, const pair& p){os << p.first << ' ' << p.second; return os;} template ostream& operator<<(ostream& os, const vector& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template ostream& operator<<(ostream& os, const vector>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template void chmin(T& a, T b){a = min(a, b);} template void chmax(T& a, T b){a = max(a, b);} int main(){ int n; cin >> n; vector s(n); cin >> s; int ans = 0; rep(y, n){ int p = 0, q = 0; rep(x, n){ if(s[y][x] == 'A') p++; if(s[y][x] == '.') q++; } if(p == n - 1 and q == 1) ans++; } rep(x, n){ int p = 0, q = 0; rep(y, n){ if(s[y][x] == 'A') p++; if(s[y][x] == '.') q++; } if(p == n - 1 and q == 1) ans++; } { int p = 0, q = 0; rep(i, n){ if(s[i][i] == 'A') p++; if(s[i][i] == '.') q++; } if(p == n - 1 and q == 1) ans++; } { int p = 0, q = 0; rep(i, n){ if(s[i][(n - 1) - i] == 'A') p++; if(s[i][(n - 1) - i] == '.') q++; } if(p == n - 1 and q == 1) ans++; } cout << ans << "\n"; return 0; }