#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
inline ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
inline void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
//对于两个回文串 P, Q, P+Q 是回文串当且仅当 P 和 Q 的最小循环节相同
//对于每个 s_i，求出所有本质不同回文串和最小循环节，用哈希判断
const ll N=4e6+9;
ll m,n,len,R[N],tot,tid,ru;
ll pr[N],prc,minp[N],vis[N];
char s[N],t[N];
namespace HASH{
	const ll Mod1=947423467,Mod2=394145643;
	const ll B1=2397467,B2=12903869;
	ll pw1[N],pw2[N],hsh1[N],hsh2[N];
	void init(ll n){
		pw1[0]=1;
		rep(i,1,n)pw1[i]=pw1[i-1]*B1%Mod1;
		pw2[0]=1;
		rep(i,1,n)pw2[i]=pw2[i-1]*B2%Mod2;
	}
	void Build(){
		rep(i,1,n)hsh1[i]=(hsh1[i-1]*B1+s[i])%Mod1;
		rep(i,1,n)hsh2[i]=(hsh2[i-1]*B2+s[i])%Mod2;
	}
	pii H(ll l,ll r){
		return make_pair((hsh1[r]-hsh1[l-1]*pw1[r-l+1]%Mod1+Mod1)%Mod1,
		(hsh2[r]-hsh2[l-1]*pw2[r-l+1]%Mod2+Mod2)%Mod2);
	}
	bool equal(ll l,ll r,ll u,ll v){
		return H(l,r)==H(u,v);
	}
}
void init(ll n){
	HASH::init(n);
	minp[1]=1;
	rep(i,2,n){
		if(!vis[i])pr[++prc]=i,minp[i]=i;
		rep(j,1,prc){
			if(pr[j]*i>n)break;
			vis[i*pr[j]]=1;
			minp[i*pr[j]]=pr[j];
			if(i%pr[j]==0)break;
		}
	}
}
ll Bord(ll l,ll r){//查询 [l,r] 循环节
	if(HASH::equal(l+1,r,l,r-1))return 1;
	ll len=r-l+1,res=r-l+1;
	while(len>1){
		if(HASH::equal(l+res/minp[len],r,l,r-res/minp[len]))res/=minp[len];
		len/=minp[len];
	}
	return res;
}
struct Seg{
	ll l,r;
}str[N];
map<pii,ll>mp1,mp2;
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	m=read();
	init(1e6);
	while(m--){
		scanf("%s",s+1);
		n=strlen(s+1);
		HASH::Build();
		len=0;
		t[++len]='$';
		rep(i,1,n)t[++len]='#',t[++len]=s[i];
		t[++len]='#',t[++len]='*';
		rep(i,0,len)R[i]=0;
		ll mx=0,id=0;
		tot=0;
		rep(i,1,len){
			if(i<=mx)R[i]=min(R[2*id-i],mx-i+1);
			while(t[i-R[i]]==t[i+R[i]]){
				if(isalpha(t[i-R[i]]))tot++,str[tot]=(Seg){(i-R[i])/2,(i+R[i])/2};
				R[i]++;
			}
			if(i+R[i]-1>mx)mx=i+R[i]-1,id=i;
		}
		rep(i,1,tot){
			pii hs=HASH::H(str[i].l,str[i].r);
			if(mp1.find(hs)!=mp1.end())continue;
			mp1[hs]=1;
			ll o=Bord(str[i].l,str[i].r);
			hs=HASH::H(str[i].l,str[i].l+o-1);
			mp2[hs]++;
		}
	}
	ll ans=0;
	for(pair<pii,ll> p:mp2)ans+=p.second*p.second;
	write(ans);
	return 0;
}