#pragma GCC optimize(0)
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> Pr;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
const ll base = 131;
const ll mod = 1000000000000002271;
inline ll read(){
    ll x=0, f=1; char ch=getchar();
    while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
    return x*f;
}
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
ll n,ans,p[100005],k[100005];
string s[100005];
pair <ll, ll> ST[100005][18];
vector<ll> g[100005];
void init(){ }
inline ll toint(char ch){
	if(ch == 'P'){
		return 1;
	}
	if(ch == 'K'){
		return 2;
	}
	return 3;
}
inline char getch(ll id,ll pos){
	return s[id][pos%s[id].size()];
}
ll pf[1000005], pg[1000005], pi[1000005];
inline ll qpow(ll a, ll b) {
	ll res = 1;
	while (b) {
		if (b & 1) {
			res = (__int128)res * a % mod;
		}
		a = (__int128)a * a % mod;
		b >>= 1;
	}
	return res;
}
inline ll inv(ll a) {
	return qpow(a, mod - 2);
}
inline ll get_pw(ll k) {
	return (__int128)pg[k / 1000000] * pf[k % 1000000] % mod;
}
inline ll get_hsh(ll id,ll pos){
	ll res=0,len=s[id].size(),tmp=g[id][s[id].size()-1];
	if (pos >= len) {
		res = (__int128)(get_pw(pos / len * len) - 1) * pi[len] % mod;
	}
	res=(__int128)res*tmp%mod;
	return ((__int128)res*get_pw(pos%len+1)+g[id][pos%len])%mod;
}
inline ll lcp(ll i, ll j) {
	if (get_hsh(i,(ll)1e12+1)==get_hsh(j,(ll)1e12+1)){
		return (ll)1e12+1;
	}
	ll l=0,r=(ll)1e12;
	while(l<=r){
		ll mid=(l+r)>>1;
		if(get_hsh(i, mid) == get_hsh(j, mid)) l = mid + 1;
		else r = mid - 1;
	}
	return r;
}
inline bool cmp(ll i,ll j){
	ll l = lcp(i, j);
	return getch(i,l+1)<getch(j,l+1);
}
inline void addmod(ll &x) {
	(x >= mod) && (x -= mod);
}
inline pair <ll, ll> query(ll l, ll r) {
	ll d = __builtin_clz(r - l + 1) ^ 31;
	return min(ST[l][d], ST[r - (1 << d) + 1][d]);
}
inline void solve(ll l, ll r) {
	if (l > r) {
		return;
	}
	pair <ll, ll> tmp = query(l, r);
	ll val = tmp.first, la = tmp.second;
	if (val == (ll)1e12 + 2) {
		return;
	}
	vector <ll> vec;
	vec.emplace_back(la);
	while (la < r) {
		tmp = query(la + 1, r);
		if (tmp.first != val) {
			break;
		}
		la = tmp.second;
		vec.emplace_back(la);
	}
	for (ll i = 0; i < (ll)vec.size() - 1; ++i) {
		ans += (ll)(vec[i + 1] - vec[i]) * (vec[i] - l + 1) * (r - vec[i + 1] + 1);
	}
	solve(l, vec[0] - 1);
	for (ll i = 0; i < (ll)vec.size() - 1; ++i) {
		solve(vec[i] + 1, vec[i + 1] - 1);
	}
	solve(vec[vec.size() - 1] + 1, r);
}
void procedure(){
	cin>>n;
    pf[0] = 1;
    for(ll i=1;i<1e6+5;i++){
    	pf[i] = (__int128)pf[i - 1] * base % mod;
    	pi[i] = inv(pf[i]-1);
    }
    pg[0] = 1;
    pg[1] = pf[1000000];
    for(ll i=2;i<1e6+5;i++){
    	pg[i] = (__int128)pg[i - 1] * pg[1] % mod;
    }
    for(ll i=1;i<=n;i++) cin>>s[i];
    for(ll i=1;i<=n;i++){
    	g[i].resize(s[i].size());
    	for(ll j=0;j<(ll)s[i].size();j++){
    		if(j == 0){
    			g[i][j] = toint(s[i][j]);
    		}
    		else{
    			g[i][j] = ((__int128)g[i][j-1] * base + toint(s[i][j])) % mod;
    		}
    	}
    }
    for(ll i=1;i<=n;i++){
    	p[i]=i;
    }
    stable_sort(p+1,p+n+1,cmp);
    --n;
    for (ll i = 1; i <= n; ++i) {
    	k[i] = lcp(p[i], p[i + 1]) + 1;
    }
    for (ll i = 1; i <= n; ++i) {
    	ST[i][0] = make_pair(k[i], i);
    }
    for (ll j = 1; j < 18; ++j) {
    	for (ll i = 1; i + (1 << j) - 1 <= n; ++i) {
    		ST[i][j] = min(ST[i][j - 1], ST[i + (1 << (j - 1))][j - 1]);
    	}
    }
    solve(1, n);
    cout<<ans<<"\n";
}
int main(){
    #ifdef LOCAL
        assert(freopen("input.txt","r",stdin));
        assert(freopen("output.txt","w",stdout));
    #endif
    ll T=1;
    init();
    while(T--) procedure();
    return 0;
}