#include<cstdio>
#include<cstring>
#include<algorithm>
#include<utility>
using namespace std;
const int o=1e6+10,M1=1e9+7,M2=1e9+9;
int n,len,tot,h1[o],pw1[o],h2[o],pw2[o];long long phi[o],ans;char s[o];pair<pair<int,int>,int> pr[o];
inline int hsh1(int l,int r){return (h1[r]+(M1-h1[l-1])*1ll*pw1[r-l+1])%M1;}
inline int hsh2(int l,int r){return (h2[r]+(M2-h2[l-1])*1ll*pw2[r-l+1])%M2;}
struct PAM{
	int ch[o][26],fail[o],len[o],sm[o],lst,cnt;
	inline void init(){
		for(int i=0;i<=cnt;++i){
			fail[i]=len[i]=sm[i]=0;
			for(int j=0;j<26;++j) ch[i][j]=0;
		}
		len[lst=fail[cnt=1]=0]=0;len[fail[0]=1]=-1;
	}
	inline int getfail(int x,int pos){for(;s[pos]^s[pos-len[x]-1];x=fail[x]);return x;}
	inline void ins(int pos){
		int cur=getfail(lst,pos);
		if(!ch[cur][s[pos]]){
			int p=++cnt;len[p]=len[cur]+2;
			fail[p]=ch[getfail(fail[cur],pos)][s[pos]];
			sm[p]=sm[fail[p]]+1;
			ch[cur][s[pos]]=p;
			pr[++tot]=make_pair(make_pair(hsh1(pos-len[p]+1,pos),hsh2(pos-len[p]+1,pos)),len[p]);
		}
		lst=ch[cur][s[pos]];
	}
}pam;
int main(){
	for(int i=1,j;i<o;++i) for(phi[i]+=i,j=i*2;j<o;j+=i) phi[j]-=phi[i];
	for(scanf("%d",&n);n--;){
		scanf("%s",s+1);len=strlen(s+1);
		for(int i=pw1[0]=pw2[0]=1;i<=len;++i)
			h1[i]=(h1[i-1]*29ll+s[i]-96)%M1,pw1[i]=pw1[i-1]*29ll%M1,
			h2[i]=(h2[i-1]*29ll+s[i]-96)%M2,pw2[i]=pw2[i-1]*29ll%M2;
		pam.init();s[0]=30;
		for(int i=1;i<=len;++i) s[i]-=97,pam.ins(i);
	}
	for(int i=1;i<o;++i) phi[i]+=phi[i-1];
	sort(pr+1,pr+tot+1);tot=unique(pr+1,pr+tot+1)-pr-1;
	for(int i=1,j,h1,h2,h1_,h2_,len;i<=tot;ans+=2*phi[j]-1,++i)
		for(h1=h1_=pr[i].first.first,h2=h2_=pr[i].first.second,len=pr[i].second,j=2;1;++j){
			h1=(h1*1ll*pw1[len]+h1_)%M1;h2=(h2*1ll*pw2[len]+h2_)%M2;
			if(make_pair(make_pair(h1,h2),len*j)!=*lower_bound(pr+1,pr+tot+1,make_pair(make_pair(h1,h2),len*j)))
				{--j;break;}
		}
	printf("%lld",ans);
	return 0;
}