#pragma GCC optimize("Ofast")

#include "bits/stdc++.h"


#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const int INFi = 2e9;
const ll INF = 2e18;

template<typename T>
std::vector<int> z_function(const T &str) {
    int n = int(str.size());
    std::vector<int> z(n);
    for (int i = 1, l = 0, r = 0; i < n; i++) {
        if (i < r)
            z[i] = std::min(r - i, z[i - l]);

        while (i + z[i] < n && str[z[i]] == str[i + z[i]])
            z[i]++;

        if (i + z[i] > r)
            l = i, r = i + z[i];
    }
    return z;
}


const int M = 2e6 + 100;
struct Node {
    int go[3];
    int nx;
    int h;
    int cnt[3];

    Node() {
        nx = 0;
        h = 0;
        rep(i, 3) cnt[i] = go[i] = 0;
    }
};

Node T[M];

int U = 1;
int create(int h = 0) {
    T[U].h = h;
    T[U].nx = U;
    return U++;
}

int Go(int v, int x) {
    if (!T[v].go[x]) {
        T[v].go[x] = create(T[v].h + 1);
    }
    return T[v].go[x];
}

ll ans = 0;
int dfs(int v) {
    rep(j, 3) {
        if (!T[v].go[j]) continue;
        T[v].cnt[j] += dfs(T[v].go[j]);
    }
    int tot = 0;
    rep(j, 3) tot += T[v].cnt[j];
    ans += 1ll * T[v].cnt[0] * T[v].cnt[1] * T[v].cnt[2];
    return tot;
}

void solve() {
    int n; cin >> n;
    vector<vi> a(n);

    int rt = create();
    rep(i, n) {
        string s; cin >> s;
        a[i].resize(s.size() * 2);
        int sz = s.size();
        rep(j, sz * 2) {
            char x = s[j % sz];
            if (x == 'P') a[i][j] = 0;
            else if (x == 'K') a[i][j] = 1;
            else a[i][j] = 2;
        }
        vi pos(sz * 2 + 1);
        {
            int v = rt;
            rep(j, sz * 2) {
                pos[j] = v;
                v = Go(v, a[i][j]);
            }
            pos[sz * 2] = v;
        }
        auto z = z_function(a[i]);
        for(int p = 1; p < sz * 2; ++p) {
            int v = pos[p];
            int val = z[p];

            int u = pos[p+val];

            if (T[T[v].nx].h < T[u].h) {
                T[v].nx = u;
            }
        }
    }

    rep(i, n) {
        int sz = a[i].size();
        int v = rt;
        rep(j, sz) v = Go(v, a[i][j]);

        int u = T[v].nx;
        T[u].cnt[a[i][T[u].h % sz]]++;
    }
    dfs(rt);
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;
//    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}