#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
template<typename A>
using vc=vector<A>;
inline int read()
{
    int s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
inline ll lread()
{
    ll s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
const int mod1=998244853;
const int mod2=1004535809;
const int base1=37;
const int base2=1145141;
char t[2000005];
char s[1000005];
int nx[2000005];
ll pre1[1000001];
ll pre2[1000001];
ll p1[1000001];
ll p2[1000001];
int n,m;
inline void init(int L)
{
    p1[0]=p2[0]=1;
    for(int i=1;i<=L;i++)
    {
        p1[i]=p1[i-1]*base1%mod1;
        p2[i]=p2[i-1]*base2%mod2;
    }
}
struct node
{
    int len;ll h1,h2;
    node(int len=0,ll h1=0,ll h2=0):len(len),h1(h1),h2(h2){}
    bool operator < (node b) const
    {
        if(len!=b.len) return len<b.len;
        if(h1!=b.h1) return h1<b.h1;
        return h2<b.h2;
    }
    node operator + (node b)
    {
        node ans;
        ans.len=len+b.len;
        ans.h1=(h1*p1[b.len]+b.h1)%mod1;
        ans.h2=(h2*p2[b.len]+b.h2)%mod2;
        return ans;
    }
};
map<node,node>cir;
set<node>pal;
inline node get(int l,int r)
{
    // printf("get %d %d\n",l,r);
    ll h1=(pre1[r]-pre1[l-1]*p1[r-l+1]%mod1+mod1)%mod1;
    ll h2=(pre2[r]-pre2[l-1]*p2[r-l+1]%mod2+mod2)%mod2;
    return node(r-l+1,h1,h2);
}
inline void run()
{
    scanf("%s",s+1),m=strlen(s+1);
    for(int i=1;i<=m;i++)
    {
        pre1[i]=(pre1[i-1]*base1+s[i]-'a'+1)%mod1;
        pre2[i]=(pre2[i-1]*base2+s[i]-'a'+1)%mod2;
    }
    int len=2*m+1;t[len+1]=0,t[0]='@';
    for(int i=1;i<=len;i++) t[i]=i&1?'#':s[i>>1];
    // printf("%s\n",t+1);

    int l=0,r=0;
    for(int i=1;i<=len;i++)
    {
        if(i<=r) nx[i]=min(r-i,nx[l+r-i]);else nx[i]=0;
        while(t[i-nx[i]-1]==t[i+nx[i]+1])
        {
            nx[i]++;
            if(t[i-nx[i]]=='#') pal.insert(get((i-nx[i]+1)/2,(i+nx[i]-1)/2));
        }
        if(i+nx[i]>r) l=i-nx[i],r=i+nx[i];
    }
}
int main()
{
    init(1000000);
    n=read();
    for(int i=1;i<=n;i++) run();

    ll ans=0;
    while(pal.size())
    {
        node f=*pal.begin();pal.erase(f);
        if(!cir.count(f)) cir[f]=f;
        node p=cir[f];
        ans+=2*f.len/p.len-1;
        cir[f+p]=p;
    }
    printf("%lld\n",ans);
    return 0;
}