#include <bits/stdc++.h>
#define Re register int
#define LL long long
using namespace std;
const int MAXN=4e6+5;
int n;
char ch[MAXN];
struct Suffix_Automaton{
    int O,link[MAXN],maxlen[MAXN],trans[MAXN][26];
    //link[i]: 后缀链接
    //trans[i]: 状态转移数组
    Suffix_Automaton(){O=1;}//根初始化为1
    inline int insert(Re ch,Re last)
    {
        if(trans[last][ch]){
            Re p=last,x=trans[p][ch];
            if(maxlen[p]+1==maxlen[x])return x;//即最初的特判1
            else{
                Re y=++O;maxlen[y]=maxlen[p]+1;
                for(Re i=0;i<26;++i)trans[y][i]=trans[x][i];
                while(p&&trans[p][ch]==x)trans[p][ch]=y,p=link[p];
                link[y]=link[x],link[x]=y;
                return y;//即最初的特判2
            }
        }
        Re z=++O,p=last;maxlen[z]=maxlen[last]+1;
        while(p&&!trans[p][ch])trans[p][ch]=z,p=link[p];
        if(!p)link[z]=1;
        else{
            Re x=trans[p][ch];
            if(maxlen[p]+1==maxlen[x])link[z]=x;
            else{
                Re y=++O;maxlen[y]=maxlen[p]+1;
                for(Re i=0;i<26;++i)trans[y][i]=trans[x][i];
                while(p&&trans[p][ch]==x)trans[p][ch]=y,p=link[p];
                link[y]=link[x],link[z]=link[x]=y;
            }
        }
        return z;
    }
}SAM;
vector<int> g[MAXN], col[MAXN];
int prt[MAXN];
pair<int, int> a[MAXN];
int get_prt(int x) {
    if (x == prt[x]) return x;
    return prt[x] = get_prt(prt[x]);
}
int cr[MAXN];
int ans;
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) prt[i] = i;
    for(Re i=1;i<=n;++i){
        scanf("%s",ch+1);
        Re last=1;
        for(Re j=1;ch[j];++j)
        {
            last=SAM.insert(ch[j]-'a',last);
            col[last].push_back(i);
        }
    }
    // for (int i = 1; i <= SAM.O; i++)
    // {
    //     cout << "u:" << i << " ";
    //     cout << "col:";
    //     for (int x : col[i]) cout << x << " ";
    //     cout << "\n";
    // }
    for (int i = 1; i <= SAM.O; i++) g[SAM.link[i]].push_back(i);
    // for (int i = 1; i <= SAM.O; i++) 
    // {
    //     cout << "u:" << i << " ";
    //     cout << "v:";
    //     for (int x : g[i]) cout << x << " ";
    //     cout << "\n";
    // }

    for (int i = 1; i <= SAM.O; i++) a[i] = make_pair(SAM.maxlen[i], i);
    sort(a + 1, a + SAM.O + 1, [](pair<int, int> A, pair<int, int> B){
        return A.first > B.first;
    });
    vector<int> vex;
    int k = 0;
    for (int i = 1; i <= SAM.O; i++) 
    {
        vex.clear();
        int u = a[i].second, val = a[i].first;
        // cout << "u:" << u << " " << val << "\n";
        for (int x : col[u]) vex.push_back(x);
        for (int x : g[u]) vex.push_back(cr[x]);
        for (int j = 1; j < vex.size(); j++)
        {
            int x = vex[j], y = vex[j - 1];
            int prtx = get_prt(x), prty = get_prt(y);
            // cout << prtx << " " << prty << "\n";
            if (prtx != prty) 
            {
                prt[prtx] = prty;
                ans += val;
                k++;
                // cout << "---------------val:" << val << "\n";
            }
        }
        if (vex.size() > 0) cr[u] = get_prt(vex[0]);
    }
    // cout << "k:" << k << "\n";
    cout << ans;
    return 0;
}
/*
4
icpc
macau
regional 
contest

3
ababa 
babab 
aba
*/