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

const int N = 1e6+10;
const int P1=13331,P2=131,B1=998244353,B2=1e9+7;
typedef long long LL;

LL ans,p1[N],p2[N];
struct Hash
{
	LL a,b;
	bool operator < (const Hash &t) const
	{
		if(a!=t.a) return a<t.a;
		else return b<t.b; 
	}
	Hash operator +(const int &t) const
	{
		return {(a*P1+t)%B1,(b*P2+t)%B2};
	}
	Hash operator -(const Hash &t) const
	{
		return {(a-t.a+B1)%B1,(b-t.b+B2)%B2};
	}
	Hash operator <<(const int &t) const
	{
		return {a*p1[t]%B1,b*p2[t]%B2};
	}
}h[N];
struct Node
{
	int ch[26];
	int len,fail;
}tr[N];
char s[N];
int n,cnt,tot,las;
map<Hash,int> mp;

int new_node(int l)
{
	int p=++tot;
	memset(tr[p].ch,0,sizeof tr[p].ch);
	tr[p].fail=0;
	tr[p].len=l;
	return p;
}

void init()
{
	cnt=las=0;
	tot=-1;
	new_node(0);
	new_node(-1);
	tr[0].fail=1;
}

int find_fail(int x)
{
	while(s[cnt]!=s[cnt-tr[x].len-1]) x=tr[x].fail;
	return x;
}

void insert(int x)
{
	int now=find_fail(las);
	if(!tr[now].ch[x])
	{
		int p=new_node(tr[now].len+2);
		tr[p].fail=tr[find_fail(tr[now].fail)].ch[x];
		tr[now].ch[x]=p;
	}
	las=tr[now].ch[x];
}

Hash sr(int l,int r)
{
	return h[r]-(h[l-1]<<(r-l+1));
}

int main()
{
	p1[0]=p2[0]=1;
	for(int i=1;i<N;i++)
	{
		p1[i]=p1[i-1]*P1%B1;
		p2[i]=p2[i-1]*P2%B2;
	}
	int t;
	cin>>t;
	while(t--)
	{
		scanf("%s",s+1);
		n=strlen(s+1);
		init();
		for(int i=1;i<=n;i++)
		h[i]=h[i-1]+(s[i]-'a'+1);
		
		for(int i=1;i<=n;i++)
		{
			cnt++;
			insert(s[i]-'a');
			int len=tr[las].len,flen=tr[tr[las].fail].len;
			int diff=len-flen;
			if(len%diff!=0)
			diff=len;
			
			Hash tmp=sr(i-diff+1,i);
			if(!mp[tmp]) mp[tmp]=len/diff;
			else mp[tmp]=max(mp[tmp],len/diff);
		}
	}
	for(auto i:mp)
	ans+=1ll*i.second*i.second;
	cout<<ans<<endl;
	return 0;
}