#include <bits/stdc++.h>
using namespace std;

using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n) for(int i=0;i<(n);++i)
#define sizc(x) ((int)(x).size())
#define allc(x) (x).begin(),(x).end()
#define fir first
#define sec second

constexpr int N = 1e6+1e5+5;

int n;
char s[N];
int te[N],tot;
ll ans;
int sa[N],rk[N],pre[N<<1],hgt[N];

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

    cin>>n;
    rep(i,1,n){
        string t;
        cin>>t;
        repn(i,t.size())s[++tot]=t[i],ans+=te[tot]=t.size()-i;
        s[++tot]='#';
    }
    rep(i,1,tot)sa[i]=i,rk[i]=s[i];
    for(int w=1;w<=tot;w<<=1){
        copy(rk+1,rk+tot+1,pre+1);
        auto cmp=[&](int x,int y){
            if(pre[x]==pre[y])return pre[x+w]<pre[y+w];
            return pre[x]<pre[y];
        };
        sort(sa+1,sa+tot+1,cmp);
        rk[sa[1]]=1;rep(i,2,tot)rk[sa[i]]=rk[sa[i-1]]+cmp(sa[i-1],sa[i]);
        if(rk[sa[tot]]==tot)break;
    }
    int lcp=0;
    rep(i,1,tot){
        if(lcp)--lcp;
        while(s[i+lcp]==s[sa[rk[i]+1]+lcp])++lcp;
        hgt[rk[i]]=lcp;
    }
    rep(i,1,tot-1)ans-=min({hgt[i],te[sa[i]],te[sa[i+1]]});
    cout<<ans<<'\n';
}