#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int N=2e6+10;
int n,tot=1;
char s[N];
struct node
{
    int len,fa,ch[27];
}dian[N];
int las[N];
ll ans;
int insert(int p,int c)
{
    if(dian[p].ch[c])
    {
        int q=dian[p].ch[c];
        if(dian[q].len==dian[p].len+1)return q;
        int nq=++tot;dian[nq]=dian[q];
        dian[nq].len=dian[p].len+1;
        dian[q].fa=nq;
        for(;p&&dian[p].ch[c]==q;p=dian[p].fa)dian[p].ch[c]=nq;
        return nq;
    }
    int np=++tot;
    dian[np].len=dian[p].len+1;
    for(;p&&!dian[p].ch[c];p=dian[p].fa)dian[p].ch[c]=np;
    if(!p)dian[np].fa=1;
    else{
        int q=dian[p].ch[c];
        if(dian[q].len==dian[p].len+1)dian[np].fa=q;
        else{
            int nq=++tot;dian[nq]=dian[q];
            dian[nq].len=dian[p].len+1;
            dian[q].fa=dian[np].fa=nq;
            for(;p&&dian[p].ch[c]==q;p=dian[p].fa)dian[p].ch[c]=nq;
        }
    }
    return np;
}
int main()
{
    // freopen("1.in","r",stdin);
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%s",s+1);
        int m=strlen(s+1),now=1;
        for(int j=1;j<=m;j++)
            now=insert(now,s[j]-'a'+1);
    }
    for(int i=2;i<=tot;i++)
        ans+=dian[i].len-dian[dian[i].fa].len;
    printf("%lld\n",ans);
    return 0;
}