// 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define db double
#define fi first
#define se second
#define vi vector<int>
#define inf 0x3f3f3f3f
using namespace std;
const int N=1e6+5;
int n,tot=1,cur;
ll f[N],res;
string str;
struct node{
    int link,slink,len,d,to[26];
}t[N];
void extend(int i,int c){
    while(t[cur].len+2>i+1||str[i]!=str[i-t[cur].len-1])cur=t[cur].link;
    if(!t[cur].to[c]){
        int p=++tot,j=t[cur].link;
        t[p].len=t[cur].len+2;
        while(str[i]!=str[i-t[j].len-1])j=t[j].link;
        j=max(1,t[j].to[c]);
        t[p].link=j,t[cur].to[c]=p,t[p].d=t[p].len-t[j].len;
        if(j==1)t[p].slink=p;
        else t[p].slink=(t[p].d==t[j].d)?t[j].slink:j;
    }cur=t[cur].to[c];
}
signed main(){
    //freopen("data.in","r",stdin);
    // freopen("own.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n;t[0].len=-1;
    for(int i=1;i<=n;i++){
        cin>>str,cur=0;
        for(int j=0;j<str.size();j++)extend(j,str[j]-'a');
    }
    for(int i=2;i<=tot;i++){
        if(t[i].len%t[i].d==0){
            int j=t[i].slink;
            //cout<<"find:"<<t[i].len<<" "<<t[i].d<<" "<<j<<" "<<t[j].len<<"\n";
            f[t[i].slink]++;
        }
        else{
            f[i]++;
        }
    }
    for(int i=2;i<=tot;i++){
        res+=f[i]*f[i];
    }
    cout<<res;
}