#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

mt19937 rng(32343);
const int N = 1e6 + 5, M = 1e5 + 5;
const int mod[2] = {998244353, (int)1e9 + 7};
const int base[2] = {19835, 128324};
int wow[105];
int pw[2][2 * N];
struct hsv
{
	int h0, h1, len;
	hsv(int a = 0, int b = 0, int c = 0)
	{
		h0 = a;
		h1 = b;
		len = c;
	}
	hsv operator + (hsv o)
	{
		return hsv(((ll)h0 * pw[0][o.len] + o.h0) % mod[0], ((ll)h1 * pw[1][o.len] + o.h1) % mod[1], len + o.len);
	}
	friend bool operator == (hsv x, hsv y)
	{
		return (x.h0 == y.h0) && (x.h1 == y.h1) && (x.len == y.len);
	}
};
vector<hsv> qwq[M];
vector<int> awa[M];
int len[M];
char s[N];
hsv val(int x, int y, int z)
{
	if(z <= len[x])
		return qwq[x][z];
	return qwq[x].back() + qwq[y][z - len[x]];
}
int ch(int x, int y, int z)
{
	if(z <= len[x])
		return awa[x][z];
	return awa[y][z - len[x]];
}
int lcp(int x, int y)
{
	int l = 1, r = len[x] + len[y], mid;
	while(l <= r)
	{
		mid = (l + r) >> 1;
		if(val(x, y, mid) == val(y, x, mid))
			l = mid + 1;
		else
			r = mid - 1;
	}
	if(l > len[x] + len[y])
		return -1;
	return r;
}
bool cmp(int x, int y)
{
	int l = lcp(x, y) + 1;
	if(l)
		return ch(x, y, l) < ch(y, x, l);
	else
		return 0;
}
int ord[M], h[M], sz[M];
int ed[M], fa[M];
bool cmp2(int x, int y)
{
	return (h[x] == h[y]) ? (x < y) : (h[x] > h[y]);
}
int getf(int x)
{
	return (x == fa[x]) ? x : (fa[x] = getf(fa[x]));
}
void un(int x, int y)
{
	x = getf(x);
	y = getf(y);
	if(x == y)
		return ;
	fa[x] = y;
	sz[y] += sz[x];
}

int main()
{
	int n, m, i, j, t, c;
	ll ans = 0;
	n = 2e6;
	for(t = 0; t < 2; t++)
	{
		pw[t][0] = 1;
		for(i = 1; i <= n; i++)
			pw[t][i] = (ll)pw[t][i - 1] * base[t] % mod[t];
	}
	scanf("%d", &n);
	for(i = 0; i < 26; i++)
		wow[i] = rng() % mod[0];
	// printf("CC%d %d %d\n", 'P' - 'A', 'K' - 'A', 'N' - 'A');
	for(i = 1; i <= n; i++)
	{
		scanf("%s", s + 1);
		m = strlen(s + 1);
		len[i] = m;
		qwq[i].resize(m + 1);
		awa[i].resize(m + 1);
		for(j = 1; j <= m; j++)
			awa[i][j] = s[j] - 'A';
		qwq[i][0] = hsv();
		for(j = 1; j <= m; j++)
			qwq[i][j] = qwq[i][j - 1] + hsv(wow[s[j] - 'A'], wow[s[j] - 'A'], 1);
	}
	for(i = 1; i <= n; i++)
		ord[i] = i;
	sort(ord + 1, ord + n + 1, cmp);
	// printf("###");
	// for(i = 1; i <= n; i++)
	// 	printf("%d ", ord[i]);
	// printf("\n");
	for(i = 1; i <= n; i++)
	{
		fa[i] = i;
		sz[i] = 1;
	}
	c = 0;
	for(i = 1; i < n; i++)
	{
		h[i] = lcp(ord[i], ord[i + 1]);
		// printf("!!%d %d\n", i, h[i]);
		if(h[i] == -1)
			un(i, i + 1);
		else
			ed[++c] = i;
	}
	sort(ed + 1, ed + c + 1, cmp2);
	for(i = 1; i <= c; i++)
	{
		if(i < c && h[ed[i]] == h[ed[i + 1]] && getf(ed[i] + 1) == getf(ed[i + 1]))
			ans += (ll)sz[getf(ed[i])] * sz[getf(ed[i] + 1)] * sz[getf(ed[i + 1] + 1)];
		un(ed[i], ed[i] + 1);
	}
	printf("%lld\n", ans);
	return 0;
}