#include // #include // #include using namespace std; // using namespace atcoder; // using bint = boost::multiprecision::cpp_int; using ll = long long; using ull = unsigned long long; using P = pair; using vi = vector; using vvi = vector; using vvvi = vector; #define rep(i,n) for(ll i = 0;i < (ll)n;i++) #define ALL(x) (x).begin(),(x).end() #define sz(c) ((ll)(c).size()) #define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin()) // #define MOD 1000000007 #define MOD 998244353 templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,vector&v){for(int i = 0;i < v.size();i++)os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.first>>p.second;return is;} int main(){ ios_base::sync_with_stdio(0), cin.tie(0); int n; cin >> n; vector s(n); cin >> s; int res = 0; rep(i,n)rep(j,n){ if(s[i][j] != '.')continue; auto f = [&](int oi,int oj,int dy,int dx){ int cnt = 0; for(int k = -n;k <= n;k++){ int ni = dy*k + oi,nj = dx*k + oj; if(ni < 0 || ni >= n || nj < 0 || nj >= n)continue; if(s[ni][nj] == 'A')cnt++; } return (cnt == n); }; s[i][j] = 'A'; res += f(i,j,0,1); res += f(i,j,1,0); res += f(i,j,1,1); res += f(i,j,-1,1); s[i][j] = '.'; } cout << res << "\n"; return 0; }