#include <bits/stdc++.h>
using namespace std;
const int maxn = 4'000'000 + 5;

namespace sfx {
    bool _t[maxn * 2];
    int hi[maxn], rev[maxn];
    int _s[maxn * 2], sa[maxn * 2], _c[maxn * 2];
    int x[maxn], _p[maxn], _q[maxn * 2];
    void pre(int *a, int *c, int n, int z) {
        memset(a, 0, sizeof(int) * n);
        memcpy(x, c, sizeof(int) * z);
    }
    void induce(int *a, int *c, int *s, bool *t, int n, int z) {
        memcpy(x + 1, c, sizeof(int) * (z - 1));
        for (int i = 0; i < n; ++i)
            if (a[i] and not t[a[i] - 1])
                a[x[s[a[i] - 1]]++] = a[i] - 1;
        memcpy(x, c, sizeof(int) * z);
        for (int i = n - 1; i >= 0; --i)
            if (a[i] and t[a[i] - 1])
                a[--x[s[a[i] - 1]]] = a[i] - 1;
    }
    void sais(int *s, int *a, int *p, int *q, bool *t, int *c, int n, int z) {
        bool uniq = t[n - 1] = true;
        int nn = 0, nmxz = -1, *nsa = a + n, *ns = s + n, last = -1;
        memset(c, 0, sizeof(int) * z);
        for (int i = 0; i < n; ++i)
            uniq &= ++c[s[i]] < 2;
        for (int i = 0; i < z - 1; ++i)
            c[i + 1] += c[i];
        if (uniq) {
            for (int i = 0; i < n; ++i)
                a[--c[s[i]]] = i;
            return;
        }
        for (int i = n - 2; i >= 0; --i)
            t[i] = (s[i] == s[i + 1] ? t[i + 1] : s[i] < s[i + 1]);
        pre(a, c, n, z);
        for (int i = 1; i <= n - 1; ++i)
            if (t[i] and not t[i - 1])
                a[--x[s[i]]] = p[q[i] = nn++] = i;
        induce(a, c, s, t, n, z);
        for (int i = 0; i < n; ++i)
            if (a[i] and t[a[i]] and not t[a[i] - 1]) {
                bool neq = last < 0 or memcmp(s + a[i], s + last, (p[q[a[i]] + 1] - a[i]) * sizeof(int));
                ns[q[last = a[i]]] = nmxz += neq;
            }
        sais(ns, nsa, p + nn, q + n, t + n, c + z, nn, nmxz + 1);
        pre(a, c, n, z);
        for (int i = nn - 1; i >= 0; --i)
            a[--x[s[p[nsa[i]]]]] = p[nsa[i]];
        induce(a, c, s, t, n, z);
    }
    void build(const basic_string<int> &s) {
        const int n = int(s.size());
        for (int i = 0; i < n; ++i)
            _s[i] = s[i];
        _s[n] = 0;
        sais(_s, sa, _p, _q, _t, _c, n + 1, maxn);
        for (int i = 0; i < n; ++i)
            rev[sa[i] = sa[i + 1]] = i;
        int ind = hi[0] = 0;
        for (int i = 0; i < n; ++i) {
            if (not rev[i]) {
                ind = 0;
                continue;
            }
            while (i + ind < n and s[i + ind] == s[sa[rev[i] - 1] + ind]) ++ind;
            hi[rev[i]] = ind ? ind-- : 0;
        }
    }
}

struct Dsu {
    vector<int> pa, rk;
    Dsu (int n) : pa(n), rk(n) {
        iota(pa.begin(), pa.end(), 0);
    }
    int anc(int x) {
        return x == pa[x] ? x : pa[x] = anc(pa[x]);
    }
    void join(int x, int y) {
        x = anc(x); y = anc(y);
        assert (x != y);
        if (rk[x] < rk[y]) swap(x, y);
        pa[y] = x;
        if (rk[x] == rk[y]) ++rk[x];
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n; cin >> n;
    vector<string> s(n);
    for (auto &si : s) cin >> si;
    
    basic_string<int> S;
    vector<int> o;
    for (int i = 0; i < n; ++i) {
        for (size_t j = 0; j < s[i].size(); ++j) {
            S += s[i][j] - 'a' + 1;
            o.push_back(i);
        }
        S += i + 27;
        o.push_back(-1);
    }
    sfx::build(S);
    vector<tuple<int, int, int>> e;
    for (size_t i = 1; i < S.size(); ++i) {
        int w = sfx::hi[i];
        int u = o[sfx::sa[i - 1]];
        int v = o[sfx::sa[i]];
        if (u == v or u == -1 or v == -1) continue;
        e.emplace_back(w, u, v);
        //cout << u << ' ' << v << ' ' << w << ": " << sfx::sa[i - 1] << ' ' << sfx::sa[i] << '\n';
    }
    int64_t ans = 0;
    Dsu dsu(n);
    sort(e.begin(), e.end(), greater<>());
    for (auto [w, u, v] : e) {
        if (dsu.anc(u) == dsu.anc(v))
            continue;
        ans += w;
        dsu.join(u, v);
    }
    cout << ans << '\n';
    return 0;
}