#include <bits/stdc++.h>
#define x first
#define X first
#define y second
#define Y second
#define pb push_back
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;

const int N = 1e5 + 500;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
const int BS = 5;
const char en='\n';
const ll LLINF=1ll<<60;
const int OFF = (1 << 18);

inline int add(int A, int B) {
	if(A + B >= MOD) return A + B - MOD;
	return A + B;
}

inline int sub(int A, int B) {
	if(A - B < 0) return A - B + MOD;
	return A - B;
}

inline int mul(int A, int B) {
	return (ll)A * B % MOD;
}

int n, pot[N], pot2[40];
string s[N];
vi hsh[N][30];

int lcp(int i, int j) {
	if(hsh[i][29][0] == hsh[j][29][0]) return INF;
	if(s[i][0] != s[j][0]) return 0;
	int ans = 0;
	int pi = 0, pj = 0;
	for(int k = 29;k >= 0;k--) {
		if(hsh[i][k][pi] == hsh[j][k][pj]) {
			pi = (pi + (1 << k)) % (int)s[i].size();
			pj = (pj + (1 << k)) % (int)s[j].size();
			ans += (1 << k);
		}
	}
	return ans;
}

bool cmp(int i, int j) {
	int lc = lcp(i, j);
	if(lc == INF) return i < j;
	return s[i][lc % (int)s[i].size()] < s[j][lc % (int)s[j].size()];
}

int encode(char c) {
	if(c == 'K') return 1;
	if(c == 'N') return 2;
	return 3;
}

int T[2 * OFF], val[N];

int miin(int A, int B) {
	return val[B] < val[A] ? B : A;
}

int query(int i, int a, int b, int lo, int hi) {
	if(lo <= a && b <= hi) return T[i];
	if(a > hi || b < lo) return 0;
	return miin(query(2 * i, a, (a + b) / 2, lo, hi), query(2 * i + 1, (a + b) / 2 + 1, b, lo, hi));
}

ll solve(int l, int r) {
	if(l > r - 1) return 0;
	int mid = query(1, 0, OFF - 1, l + 1, r);
	if(val[mid] == INF) return 0;
	int mid2 = query(1, 0, OFF - 1, mid + 1, r);
	if(val[mid] != val[mid2])
		return solve(l, mid - 1) + solve(mid, r);
	return solve(l, mid - 1) + solve(mid, mid2 - 1) + solve(mid2, r) +
			(ll)(mid - l) * (mid2 - mid) * (r - mid2 + 1);
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); pot[0] = 1; pot2[0] = BS;
	for(int i = 1;i < N;i++) {
		pot[i] = mul(pot[i - 1], BS);
	}
	for(int i = 1;i < 40;i++)
		pot2[i] = mul(pot2[i - 1], pot2[i - 1]);
	cin >> n;
	vector < int > sve(n);
	for(int i = 0;i < n;i++) {
		cin >> s[i]; sve[i] = i;
		int m = (int)s[i].size();
		for(int j = 0;j < 30;j++) hsh[i][j].resize(m);
		for(int j = 0;j < m;j++) {
			hsh[i][0][j] = encode(s[i][j]);
		}
		for(int j = 1;j < 30;j++) {
			for(int l = 0;l < m;l++) {
				int nxt = (l + (1 << (j - 1))) % m;
				hsh[i][j][l] = add(hsh[i][j - 1][l], mul(pot2[j - 1], hsh[i][j - 1][nxt]));
			}
		}
	}
	sort(sve.begin(), sve.end(), cmp);
	for(int i = 1;i < n;i++) val[i] = lcp(sve[i], sve[i - 1]), T[OFF + i] = i;
	for(int i = OFF - 1; i ; i--) T[i] = miin(T[2 * i], T[2 * i + 1]);
	val[0] = INF;
	cout << solve(0, n - 1) << endl;
	return 0;
}