#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int mod=998244353;
int add(int x,int y){x+=y;return x>=mod?x-mod:x;}
int sub(int x,int y){x-=y;return x<0?x+mod:x;}
int mul(int x,int y){return (ll)x*y%mod;}

const int N=1000050;
const int base=37;
int po[N];

char s[N];

int img,zero,tsz,go[N][26],link[N],len[N];
int hsh[N];

void init(){
	img=++tsz;
	zero=++tsz;
	len[img]=-1;
	len[zero]=0;
	link[zero]=img;
	link[img]=img;

	po[0]=1;
	for(int i=1;i<N;i++){
		po[i]=mul(po[i-1],base);
	}
}

set<pair<int,int>> all;
void DFS(int u){
	if(len[u]>0){
		assert(!all.count({len[u],hsh[u]}));
		all.insert({len[u],hsh[u]});
	}
	for(int i=0;i<26;i++){
		if(go[u][i]){
			hsh[go[u][i]]=add(add(i+1,mul(i+1,po[len[u]+1])),mul(hsh[u],base));
			DFS(go[u][i]);
		}
	}
}

int main(){
	int n;
	scanf("%i",&n);
	init();
	for(int i=1;i<=n;i++){
		scanf("%s",s+1);
		int m=strlen(s+1);
		int curr=zero;
		for(int j=1;j<=m;j++){
			while(j-len[curr]-1<=0 || s[j]!=s[j-len[curr]-1]){
				curr=link[curr];
			}
			int next=go[curr][s[j]-'a'];
			if(next==0){
				next=++tsz;
				go[curr][s[j]-'a']=next;
				len[next]=len[curr]+2;
				if(len[next]==1){
					link[next]=zero;
				}else{
					int up=link[curr];
					while(j-len[up]-1<=0 || s[j]!=s[j-len[up]-1]){
						up=link[up];
					}
					link[next]=go[up][s[j]-'a'];
				}
			}
			curr=next;
		}
	}
	hsh[zero]=0;
	DFS(zero);
	for(int i=0;i<26;i++){
		if(go[img][i]!=0){
			hsh[go[img][i]]=i+1;
			DFS(go[img][i]);
		}
	}
	ll ans=0;
	while(all.size()){
		int len=all.begin()->first;
		int hsh=all.begin()->second;
		int len1=len;
		int hsh1=hsh;
		int cnt=0;
		while(true){
			if(all.count({len1,hsh1})){
				cnt++;
				all.erase({len1,hsh1});
				len1+=len;
				hsh1=add(hsh,mul(po[len],hsh1));
			}else{
				break;
			}
		}
		ans+=(ll)cnt*cnt;
	}
	printf("%lld\n",ans);
	return 0;
}