#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
#include<cstring>
using namespace std;
typedef long long ll;
struct Edge{
    int u,v,d;
}e[4000005];
string s,t[2000005];
int len,n,id[4000005],cnt[4000005],oldrk[4000005],rk[4000005],sa[4000005],height[4000005];
int pos[4000005],fa[2000005],num;
ll ans;
bool cmp(Edge a,Edge b){
    return a.d>b.d;
}
int fnd(int x){
    if(fa[x]==x)
        return x;
    return fa[x]=fnd(fa[x]);
}
void get_sa(string &t){
    static int s[4000005];
    int m=128;
    for(int i=1;i<=len;i++)
        s[i]=t[i]=='#'?++m:t[i];
    m+=5;
    int i,p,k;
    for(i=1;i<=len;i++)
        cnt[rk[i]=s[i]]++;
    for(i=1;i<=m;i++)
        cnt[i]+=cnt[i-1];
    for(i=len;i>=1;i--)
        sa[cnt[rk[i]]--]=i;
    for(int w=1;;w<<=1,m=p){
        int cur=0;
        for(i=len-w+1;i<=len;i++)
            id[++cur]=i;
        for(i=1;i<=len;i++)
            if(sa[i]>w)
                id[++cur]=sa[i]-w;
        memset(cnt,0,sizeof(cnt));
        for(i=1;i<=len;i++)
            cnt[rk[i]]++;
        for(i=1;i<=m;i++)
            cnt[i]+=cnt[i-1];
        for(i=len;i>=1;i--)
            sa[cnt[rk[id[i]]]--]=id[i];
        p=0;
        memcpy(oldrk,rk,sizeof(oldrk));
        for(i=1;i<=len;i++){
            if(oldrk[sa[i]]==oldrk[sa[i-1]]&&oldrk[sa[i]+w]==oldrk[sa[i-1]+w])
                rk[sa[i]]=p;
            else
                rk[sa[i]]=++p;
        }
        if(p==len)
            break;
    }
    for(i=1,k=0;i<=len;++i){
        if(rk[i]==0)
            continue;
        if(k)
            --k;
        while(s[i+k]==s[sa[rk[i]-1]+k])
            ++k;
        height[rk[i]]=k;
    }
}
inline int read(){
    int x=0,f=1; char c=getchar();
    while(c>'9'||c<'0'){if(c=='-') f=-1; c=getchar();}
    while(c<='9'&&c>='0') x=x*10+c-'0',c=getchar();
    return x*f;
}
int main(){
    int i,j;
    n=read();
    for(i=1;i<=n;i++)
        fa[i]=i;
    for(i=1;i<=n;i++){
        t[i]='#';
        char c;
        while(!isalpha(c=getchar()));
        t[i]+=c;
        while(isalpha(c=getchar()))
            t[i]+=c;
        for(j=int(s.length())+1;j<int(s.length())+int(t[i].length());j++)
            pos[j]=i;
        s+=t[i];
    }
    len=s.length()-1;
    get_sa(s);
    for(i=2;i<=len;i++){
        int u=pos[sa[i]],v=pos[sa[i-1]];
        if(u&&v&&u!=v)
            e[++num]=(Edge){u,v,height[i]};
    }
    sort(e+1,e+num+1,cmp);
    for(i=1;i<=num;i++){
        int u=e[i].u,v=e[i].v,d=e[i].d;
        u=fnd(u);v=fnd(v);
        if(u==v)
            continue;
        ans+=d;
        fa[u]=v;
    }
    printf("%lld\n",ans);
    return 0;
}
//abababab