#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}




int main()
{

    int Q;
    Q = 1;
    //cin >> Q;



    while (Q--) {
        int n;
        cin >> n;
        vector<string>p(n);
        for (int i = 0; i < n; i++)cin >> p[i];
        int ans = 0;
        for (int i = 0; i < n; i++) {
            int a = 0;
            int b = 0;
            int c = 0, d = 0;
            for (int j = 0; j < n; j++) {
                if (p[i][j] == 'A')a++;
                else if (p[i][j] == 'B')a += n;
                if (p[j][i] == 'A')b++;
                else if (p[j][i] == 'B')b += n;
            }
            if (a == n - 1)ans++;
            if (b == n - 1)ans++;
        }
        int a = 0, b = 0;
        for (int i = 0; i < n; i++) {
            if (p[i][i] == 'A')a++;
            else if (p[i][i] == 'B')a += n;
            if (p[n-1-i][i] == 'A')b++;
            else if (p[n-1-i][i] == 'B')b += n;
        }
        if (a == n - 1)ans++;
        if (b == n - 1)ans++;

        cout << ans;

    }
        return 0;
}