#include <bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
    int ch = 0, f = 0; x = 0;
    for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
    for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
    if(f) x = -x;
}
const int N = 6000005;
ll ans;
namespace ac{
    vector<int> g[N];
    int ch[N][3], sz[N][3], val[N], len[N], top[N], buf[N], size = 1;
    vector<int> nxt = {0, 0}, str = {-1}, stk;
    inline void ins(vector<int> vec){
        int p = 1;
        for(int o = 1; o <= 2; o++){
            for(auto c : vec){
                for(int i = 0; i < 3; i++) if(!ch[p][i]){
                    ch[p][i] = ++size;
                    len[size] = len[p] + 1;
                }
                p = ch[p][c];
                // cout << "(" << c << ", " << p << ")";
                for(int d = o; d <= 2; d++) sz[p][d]++;
            }
            if(o == 1) val[p]++;
        }
    }
    inline void add(int x, int y){ buf[x] += y; }
    inline void calc(int u, int pa){
        // cout << u << endl;
        int a = ch[u][0], b = ch[u][1], c = ch[u][2];
        ans += 1ll * sz[a][2] * sz[b][2] * sz[c][2];
        
        if(u > 1){
            if(len[u] >= 2){
                int n = nxt.back();
                while(n && str[n+1] != str.back()) n = nxt[n];
                if(str[n+1] == str.back()) n++;
                nxt.push_back(n);
            }

            ll coe = 0;
            for(int i = 0; i < 3; i++) if(ch[pa][i] == u){
                coe = 1;
                for(int j = 0; j < 3; j++) if(j != i)
                    coe *= sz[ch[pa][j]][2];
            }

            int q = nxt.back(), res = 0;
            int n = (int) stk.size();
            while(q) res += val[stk[n - q - 1]], q = nxt[q];
            // cout << u << " " << res << " " << sz[u][2] << " " << sz[u][1] << " " << nxt.back() << " " << n << " " << stk[0] << endl;
            ans += coe * (res - sz[u][2] + sz[u][1]);
        }

        for(int i = 0; i < 3; i++) if(ch[u][i]){
            str.push_back(i);
            stk.push_back(ch[u][i]);
            calc(ch[u][i], u);
            str.pop_back();
            stk.pop_back();
            if(len[ch[u][i]] >= 2) nxt.pop_back();
        }

    }
}
char str[N];
int main(){
    int m; read(m);
    while(m--){
        scanf("%s", str + 1);
        int n = strlen(str + 1);
        vector<int> nxt(n + 1, 0);
        for(int i = 2, j = 0; i <= n; nxt[i++] = j){
            while(j && str[j+1] != str[i]) j = nxt[j];
            if(str[j+1] == str[i]) j++;
        }
        vector<int> vec;
        int q = nxt[n];
        while(n % (n - q)) q = nxt[q];
        for(int i = 1; i <= n - q; i++){
           int c = 0;
           if(str[i] == 'P') c = 1;
           if(str[i] == 'K') c = 2;
           vec.push_back(c);
        }
        ac::ins(vec);
    }
    ac::calc(1, 0);
    cout << ans << endl;
    return 0;
}