#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<int(n); ++i)
#define repll(i,m,n) for(ll i=m; i<ll(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi first
#define se second

template<typename T> bool chmin(T& a, T b){ if(a > b){a = b; return true;} return false; }
template<typename T> bool chmax(T& a, T b){ if(a < b){a = b; return true;} return false; }

template<typename T> T gcd(T a, T b){ return a % b ? gcd(b, a % b) : b; }
template<typename T> T lcm(T a, T b){ return a / gcd(a, b) * b; }

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    vector<string> S(N);
    rep(i, 0, N) cin >> S[i];

    int ans = 0;

    rep(y, 0, N){
        int cnt_a = 0, cnt_d = 0;
        rep(x, 0, N){
            if(S[y][x] == 'A') ++cnt_a;
            if(S[y][x] == '.') ++cnt_d;
        }
        if(cnt_a == N-1 && cnt_d == 1) ++ans;
    }

    rep(x, 0, N){
        int cnt_a = 0, cnt_d = 0;
        rep(y, 0, N){
            if(S[y][x] == 'A') ++cnt_a;
            if(S[y][x] == '.') ++cnt_d;
        }
        if(cnt_a == N-1 && cnt_d == 1) ++ans;
    }

    int cnt_a = 0, cnt_d = 0;
    rep(i, 0, N){
        if(S[i][i] == 'A') ++cnt_a;
        if(S[i][i] == '.') ++cnt_d;
    }
    if(cnt_a == N-1 && cnt_d == 1) ++ans;

    cnt_a = 0, cnt_d = 0;
    rep(i, 0, N){
        if(S[i][N-1-i] == 'A') ++cnt_a;
        if(S[i][N-1-i] == '.') ++cnt_d;
    }
    if(cnt_a == N-1 && cnt_d == 1) ++ans;

    cout << ans << endl;
    return 0;
}