#pragma GCC optimize("O3,unroll-loops")
#include <iostream>
#include <vector>
#include <array>
using namespace std;
typedef array<short,4> 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],0};}
const int N = 22;
const int V = 22*22*22;
alignas(32) pt B[V];
alignas(32) pt A[V];
alignas(32) pt P[V];
alignas(32) pt C[V];
int bs=0,as=0,ps=0,cs=0;

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[bs++] = (pt{i,j,k});
                else if(s[k]=='A') A[as++]=(pt{i,j,k});
                else if(s[k]=='P') P[ps++]=(pt{i,j,k});
                else if(s[k]=='C') C[cs++]=(pt{i,j,k});
            }
        }
    }
    long long ans=0;
    
    for(int i=0;i<as;++i) {
        pt a = A[i];
        for(int j=0;j<ps;++j) {
            pt p = P[j];
            pt vec = p-a;
            int bbs=0;
            short want = in(vec,a);
            for(int k=0;k<bs;++k) {
                bbs+=(in(B[k],vec)==want);
            }
            if(!bbs) continue;
            int ccs=0;
            want = in(vec,p);
            for(int k=0;k<cs;++k) {
                ccs+=(in(C[k],vec)==want);
            }
            ans+=(long long)bbs*ccs;
        }
    }
    cout << ans << '\n';
}