#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+10;
int base=1341;
const int hmod=4e6+37;
const int mod=1004535809;
int n,m,x,y;ll ans;
char s[N];
int last,tot,tmp,xx;
int len[N],link[N],trans[N][27];
int size[N];int h[N],pw[N];
int from[N];bool t[N];
int head[hmod],slen[N],nextn[N];
int i,edg;
vector<int> to[N];
inline void add(int x,int l){
	int s=x%hmod;
	from[++edg]=x;slen[edg]=l;
	nextn[edg]=head[s];head[s]=edg;
}
inline bool inq(int x,int l){
	for(i=head[x%hmod];i;i=nextn[i]){
		if(from[i]==x&&slen[i]==l)return 1;
	}
	return 0;
}
inline int find(int x,int l){
	for(i=head[x%hmod];i;i=nextn[i]){
		if(from[i]==x&&slen[i]==l)return i;
	}
	return 0;
}
void extend(char a,int i){
	y=last;
	for(;s[i-len[y]-1]!=a;y=link[y]);
	if(!trans[y][a]){
		tmp=++tot;xx=link[y];
		for(;s[i-len[xx]-1]!=a;xx=link[xx]);
		!trans[xx][a]?link[tmp]=2:
		link[tmp]=trans[xx][a];
		trans[y][a]=tmp;
		len[tmp]=len[y]+2;
		if(y==1)h[tmp]=1ll*a*base%mod;
		else h[tmp]=(1ll*h[y]*base+1ll*a*base+1ll*a*pw[len[tmp]])%mod;
		size[tmp]=size[link[tmp]]+1;
		if(!inq(h[tmp],len[tmp])){
			add(h[tmp],len[tmp]);
		}
		last=tmp;
	}
	else last=trans[y][a];
}
char ch;
main(){
	srand(time(NULL));
	base+=rand();
	int T;scanf("%d",&T); 
	int i;
	pw[0]=1;
	for(i=1;i<=1000005;++i)pw[i]=1ll*pw[i-1]*base%mod;
	while(T--){
		last=tot=2;
		len[1]=-1,len[2]=0;
		link[2]=link[1]=1;
		ch=getchar();m=0;
		while(ch<97)ch=getchar();
		while(ch>96)s[++m]=ch-96,ch=getchar();
		for(i=1;i<=m;++i)extend(s[i],i);
		memset(size+1,0,tot<<2);
		memset(link+1,0,tot<<2);
		memset(len+1,0,tot<<2);
		memset(h+1,0,tot<<3);
		for(i=1;i<=tot;++i)
		  memset(trans[i],0,sizeof(trans[i]));
		m>n&&(n=m);
	}
	int hh,hhk;int j,idj,cnt;
	for(i=1;i<=edg;++i)to[slen[i]].push_back(i);
	for(i=1;i<=n;++i)for(int id:to[i]){
		if(t[id])continue;
		hh=from[id];hhk=0;
		cnt=0;
		for(j=i;j<=n;j+=i){
			hhk=(1ll*hhk*pw[i]+hh)%mod;
			if(idj=find(hhk,j)){
				t[idj]=1;
				++cnt;
			}	
			else break;
		}
		ans+=1ll*cnt*cnt;
	}
	printf("%lld\n",ans);
}