/*
sa, rk 从 0 开始
lc_i 即 height_i，即 lcp(sa_i, sa_{i - 1})
*/
#include <bits/stdc++.h>
using namespace std;
struct SuffixArray {
    int n;
    std::vector<int> sa, rk, lc;
    SuffixArray(vector<int> s) {
        n = s.size();
        sa.resize(n);
        lc.resize(n);
        rk.resize(n);
        lc[0] = 0;
        std::iota(sa.begin(), sa.end(), 0);
        std::sort(sa.begin(), sa.end(), [&](int a, int b) {return s[a] < s[b];});
        rk[sa[0]] = 0;
        for (int i = 1; i < n; ++i)
            rk[sa[i]] = rk[sa[i - 1]] + (s[sa[i]] != s[sa[i - 1]]);
        int k = 1;
        std::vector<int> tmp, cnt(n);
        tmp.reserve(n);
        while (rk[sa[n - 1]] < n - 1) {
            tmp.clear();
            for (int i = 0; i < k; ++i)
                tmp.push_back(n - k + i);
            for (auto i : sa)
                if (i >= k)
                    tmp.push_back(i - k);
            std::fill(cnt.begin(), cnt.end(), 0);
            for (int i = 0; i < n; ++i)
                ++cnt[rk[i]];
            for (int i = 1; i < n; ++i)
                cnt[i] += cnt[i - 1];
            for (int i = n - 1; i >= 0; --i)
                sa[--cnt[rk[tmp[i]]]] = tmp[i];
            std::swap(rk, tmp);
            rk[sa[0]] = 0;
            for (int i = 1; i < n; ++i)
                rk[sa[i]] = rk[sa[i - 1]] + (tmp[sa[i - 1]] < tmp[sa[i]] || sa[i - 1] + k == n || tmp[sa[i - 1] + k] < tmp[sa[i] + k]);
            k *= 2;
        }
        for (int i = 0, j = 0; i < n; ++i) {
            if (rk[i] == 0) {
                j = 0;
            } else {
                for (j -= j > 0; i + j < n && sa[rk[i] - 1] + j < n && s[i + j] == s[sa[rk[i] - 1] + j]; )
                    ++j;
                lc[rk[i]] = j;
            }
        }
    }
};
int n;
vector<int>a;
vector<int>bel;
vector<int>fa;
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
int tot=256;
int m=0;
struct edge
{
    int u,v,w;
};
vector<edge>e;
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(0);
    cin>>n;
    fa.resize(n+1);
    for(int i=1;i<=n;i++)fa[i]=i;
    for(int i=1;i<=n;i++)
    {
        string t;
        cin>>t;
        ++tot;
        a.push_back(tot);
        bel.push_back(-1);
        for(int j=0;j<t.size();j++)
        {
            a.push_back(t[j]);
            bel.push_back(i);
        }
    }
    SuffixArray sa(a);
    for(int i=0;i<sa.n-1;i++)
    {
        if(bel[sa.sa[i]]==-1)continue;
        if(bel[sa.sa[i+1]]==-1)continue;
        if(bel[sa.sa[i]]!=bel[sa.sa[i+1]])
        {
            int x=sa.sa[i],y=sa.sa[i+1];
            e.push_back({bel[x],bel[y],sa.lc[i+1]});
        }
    }
    sort(e.begin(),e.end(),[&](edge a,edge b){return a.w>b.w;});
    int ans=0;
    for(auto i:e)
    {
        int x=find(i.u),y=find(i.v);
        if(x!=y)
        {
            fa[x]=y;
            m++;
            ans+=i.w;
            if(m==n-1)
            {
                cout<<ans<<'\n';
                return 0;
            }
        }
    }
    cout<<ans<<'\n';
}