#include <bits/stdc++.h>
// #define int long long
#define inf 0x3f3f3f3f
#define ll long long
#define pii pair<int, int>
#define tii tuple<int, int, int>
#define db double
#define all(a) a.begin(), a.end()
using namespace std;
const int maxn = 4e6 + 1000;
const int mod = 998244353;
struct SAM{
    int tot, fa[maxn], len[maxn], c[maxn][26];
    vector<int> vec[maxn];
    unordered_map<int, bool> mp[maxn];
    SAM(){tot = 1;}
    int id[maxn], tong[maxn];
    void topo() { //基数排序后, 逆序枚举为拓扑序
        for (int i = 1; i <= tot; i++) tong[len[i]]++;
        for (int i = 1; i <= tot; i++) tong[i] += tong[i - 1];
        for (int i = tot; i; i--) id[tong[len[i]]--] = i;
    }
    int extend(char chr, int last, int i){
        int ch = chr - 'a';
        if (c[last][ch]) {
            int p = last, x = c[p][ch];
            if (len[p] + 1 == len[x]) return x;
            else {
                int y = ++tot;
                len[y] = len[p] + 1;
                memcpy(c[y], c[x], sizeof c[y]);
                while (p && c[p][ch] == x)
                    c[p][ch] = y, p = fa[p];
                fa[y] = fa[x], fa[x] = y;
                return y; 
            }
        }
        int z = ++tot, p = last;
        len[z] = len[last] + 1;
        while (p && !c[p][ch])
            c[p][ch] = z, p = fa[p];
        if (!p) fa[z] = 1;
        else {
            int x = c[p][ch];
            if (len[p] + 1 == len[x]) fa[z] = x;
            else {
                int y = ++tot;
                len[y] = len[p] + 1;
                memcpy(c[y], c[x], sizeof c[y]);
                while (p && c[p][ch] == x)
                    c[p][ch] = y, p = fa[p];
                fa[y] = fa[x], fa[z] = fa[x] = y;
            }
        }
        return z;
    }
} sam;
int fa[maxn];
int Find(int x) {return fa[x] == x ? fa[x] : fa[x] = Find(fa[x]);}
void solve() {
    int n; cin >> n;
    for (int i = 1; i <= n; i++) fa[i] = i;
    for (int i = 1; i <= n; i++) {
        string str; cin >> str;
        int lst = 1;
        for (auto ch : str)
            lst = sam.extend(ch, lst, i), sam.vec[lst].push_back(i), sam.mp[lst][i] = 1;
    }
    sam.topo();
    ll ans = 0 ;
    for (int i = sam.tot; i > 1; i--) {
        sam.mp[sam.id[i]].clear();
        auto& vec = sam.vec[sam.id[i]];
        if (!sam.mp[sam.fa[sam.id[i]]].count(vec[0]))
            sam.vec[sam.fa[sam.id[i]]].push_back(vec[0]);
        for (int j = 1; j < vec.size(); j++) {
            if (!sam.mp[sam.fa[sam.id[i]]].count(vec[j]))
                sam.vec[sam.fa[sam.id[i]]].push_back(vec[j]);
            int u = vec[j - 1], v = vec[j];
            u = Find(u), v = Find(v);
            if (u == v) continue;
            fa[u] = v;
            ans += sam.len[sam.id[i]];
        }
        vec.clear();
    }
    cout << ans << "\n";
}
signed main() {
    // freopen("1.in", "r", stdin);
    // freopen("1.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}