#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod1=998244353,mod2=1000000009,MAX=1000005,INF=1<<30;

struct Rollinghash{
    string S;
    int n;
    int base1;
    int base2;
    vector<ll> h1,h2,ru1,ru2;
    
    void make(string &T,int ba1,int ba2){
        S=T;
        n=S.size();
        h1.assign(n+1,0);
        h2.assign(n+1,0);
        ru1.assign(n+1,0);
        ru2.assign(n+1,0);
        base1=ba1;
        base2=ba2;
        
        ru1[0]=1;
        ru2[0]=1;
        
        for(int i=1;i<=n;i++){
            h1[i]=h1[i-1]*base1+ll(S[i-1]-'A');
            h1[i]%=mod1;
            
            h2[i]=h2[i-1]*base2+ll(S[i-1]-'A');
            h2[i]%=mod2;
            
            ru1[i]=ru1[i-1]*base1%mod1;
            ru2[i]=ru2[i-1]*base2%mod2;
        }
    }
    
    pair<ll,ll> ha(int l,int r){
        pair<ll,ll> res;
        res.fi=(h1[r]-h1[l]*ru1[r-l]%mod1+mod1)%mod1;
        res.se=(h2[r]-h2[l]*ru2[r-l]%mod2+mod2)%mod2;
        
        return res;
    }//開区間
};

// Manachar

// https://snuke.hatenablog.com/entry/2014/12/02/235837

vector<int> Manachar(string S){
    vector<int> R(si(S));
    int c = 0;
    for (int i = 0; i < S.size(); ++i) {
        int l = c - (i-c);
        if (i+R[l] < c+R[c]) {
            R[i] = R[l];
        } else {
            int j = c+R[c] - i;
            while (i-j >= 0 && i+j < S.size() && S[i-j] == S[i+j]) ++j;
            R[i] = j;
            c = i;
        }
    }
    return R;
}

map<pair<int,int>,pair<int,int>> kai[MAX];
map<pair<int,int>,int> dp[MAX];

vector<int> yaku[MAX];

ll rui1(ll a,ll b){
    ll ans=1;
    while(b>0){
        if(b&1) ans=ans*a%mod1;
        a=a*a%mod1;
        b/=2;
    }
    return ans;
}

ll rui2(ll a,ll b){
    ll ans=1;
    while(b>0){
        if(b&1) ans=ans*a%mod2;
        a=a*a%mod2;
        b/=2;
    }
    return ans;
}

int la[MAX];
pair<ll,ll> ke[MAX];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    
    for(int i=1;i<MAX;i++){
        for(int j=2*i;j<MAX;j+=i) yaku[j].push_back(i);
    }
    
    ll ha1=rng()%mod1,ha2=rng()%mod2;
    
    int N;cin>>N;
    vector<string> S(N);
    for(int ii=0;ii<N;ii++){
        string T,U;cin>>U;
        for(char c:U){
            if(si(T)) T+='$';
            T+=c;
        }
        auto re=Manachar(T);
        
        Rollinghash ro;ro.make(U,ha1,ha2);
        
        for(int i=0;i<si(re);i++){
            int s,t;
            if(i%2==0){
                s=i/2-(re[i]-1)/2;
                t=i/2+(re[i]-1)/2;
            }else{
                s=i/2-(re[i]/2-1);
                t=i/2+(re[i]/2);
            }
            while(s<=t){
                auto z=ro.ha(s,t+1);
                if(kai[t+1-s].count(z)){
                    break;
                }else{
                    kai[t+1-s][z]=mp(ii,s);
                    //cout<<U.substr(s,t-s+1)<<endl;
                    s++;
                    t--;
                }
            }
        }
        S[ii]=U;
    }
    
    for(int len=1;len<MAX;len++){
        for(auto x:kai[len]){
            auto [a,b]=x.fi;
            auto [i,s]=x.se;
            //cout<<len<<" "<<i<<" "<<s<<endl;
            bool ok=true;
            for(int pre:yaku[len]){
                ll kee1,kee2;
                if(la[pre]==len){
                    kee1=ke[pre].fi;
                    kee2=ke[pre].se;
                }else{
                    ll x1=rui1(ha1,pre);
                    ll ke1=rui1(x1,len/pre)-1;
                    //assert(ke1>=1);
                    ll r1=rui1(x1-1,mod1-2);
                    ke1*=r1;ke1%=mod1;
                    ke1=rui1(ke1,mod1-2);
                    
                    ll x2=rui2(ha2,pre);
                    ll ke2=rui2(x2,len/pre)-1;
                    //assert(ke2>=1);
                    ll r2=rui2(x2-1,mod2-2);
                    ke2*=r2;ke2%=mod2;
                    ke2=rui2(ke2,mod2-2);
                    //ll ke2=rui2(rui2(rui2(307,pre)+1,len/pre-1),mod2-2);
                    
                    la[pre]=len;
                    ke[pre]=mp(ke1,ke2);
                }
                kee1=ke[pre].fi;
                kee2=ke[pre].se;
                
                auto ha=mp(a*kee1%mod1,b*kee2%mod2);
                if(dp[pre].count(ha)){
                    chmax(dp[pre][ha],len/pre);
                    ok=false;
                    break;
                }
            }
            //cout<<ok<<endl;
            if(ok){
                dp[len][x.fi]=1;
            }
        }
    }
    
    ll ans=0;
    
    for(int len=1;len<MAX;len++){
        for(auto [a,b]:dp[len]){
            ans+=(ll)b*(ll)b;
        }
    }
    
    cout<<ans<<endl;
}