#include <iostream>
#include <vector>
#include <array>
using namespace std;
typedef array<short,3> pt;
short in(pt a, pt b) {
    return a[0]*b[0]+a[1]*b[1]+a[2]*b[2];
}
pt operator-(pt a, pt b) {return {a[0]-b[0],a[1]-b[1],a[2]-b[2]};}
vector<pt> B,A,P,C;
const int N = 22;
short nB[N][2*N][2*N][N*N*6] = {};
short nC[N][2*N][2*N][N*N*6] = {};
short& g(auto& arr, int i, int j, int k, int in) {
    if(i<0) i=-i,j=-j,k=-k, in=-in;
    return arr[i][j+N-1][k+N-1][in+3*N*N];
}
int main() {
    int n; cin >> n;
    for(int i=0;i<n;++i) {
        char tmp; cin >> tmp;
        for(int j=0;j<n;++j) {
            string s; cin >> s;
            for(int k=0;k<n;++k) {
                if(s[k]=='B') B.push_back({i,j,k});
                else if(s[k]=='A') A.push_back({i,j,k});
                else if(s[k]=='P') P.push_back({i,j,k});
                else if(s[k]=='C') C.push_back({i,j,k});
            }
        }
    }
    for(int i=0;i<N;++i) for(int j=-N+1;j<N;++j) for(int k=-N+1;k<N;++k) {
        for(auto p : B) g(nB,i,j,k,in({i,j,k},p))++;
        for(auto p : C) g(nC,i,j,k,in({i,j,k},p))++;
    }
    long long ans=0;
    for(pt p : A) for(pt q : P) {
        auto z = q-p;
        ans+=(long long)g(nB,z[0],z[1],z[2],in(z,p))*g(nC,z[0],z[1],z[2],in(z,q));
    }
    cout << ans << '\n';
}