#include<bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back
#define all0(x) (x).begin(), (x).end()
#define all1(x) (x).begin() + 1, (x).end()
typedef pair<int, int> pi;
#define fi first
#define se second
typedef long long LL;


struct SuffixArray {
    int n; 
    V<int> sa, rk, ht;
    SuffixArray(const V<int> &s) {
        n = s.size() - 1;
        sa.resize(n + 1), rk.resize(n + 1), ht.resize(n);
        iota(all1(sa), 1);
        sort(all1(sa), [&](int a, int b) {
            return s[a] < s[b];
        });
        rk[sa[1]] = 1;
        for(int i = 2; i <= n; i++) rk[sa[i]] = rk[sa[i - 1]] + (s[sa[i]] != s[sa[i - 1]]);
        int k = 1;
        V<int> tmp, cnt(n + 1);
        tmp.reserve(n + 1);
        while(rk[sa[n]] < n) {
            tmp.resize(1);
            for(int i = 1; i <= k; i++) tmp.pb(n - k + i);
            for(auto i : sa) if(i > k) tmp.pb(i - k);
            fill(all1(cnt), 0);
            for(int i = 1; i <= n; i++) cnt[rk[i]]++;
            for(int i = 2; i <= n; i++) cnt[i] += cnt[i - 1];
            for(int i = n; i >= 1; i--) sa[cnt[rk[tmp[i]]]--] = tmp[i];
            swap(rk, tmp);
            rk[sa[1]] = 1;
            for(int i = 2; i <= n; i++) 
                rk[sa[i]] = rk[sa[i - 1]] + (tmp[sa[i - 1]] < tmp[sa[i]]
                || sa[i - 1] + k == n + 1 || tmp[sa[i - 1] + k] < tmp[sa[i] + k]);
            k *= 2;
        }
        for(int i = 1, j = 0; i <= n; i++) {
            if(rk[i] == 1) {
                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++;
                ht[rk[i] - 1] = j;
            }
        }
    }
};

const int MN = 3e6 + 10;
int f[MN], siz[MN];
int par(int x) {
    if(x == f[x]) return x;
    return f[x] = par(f[x]);
}
void mer(int a, int b) {
    a = par(a), b = par(b);
    if(a == b) return;
    f[a] = b;
    siz[b] += siz[a];
}

void ini(int n) {
    for(int i = 1; i <= n; i++) f[i] = i, siz[i] = 1;
}


void solve() {
    int n; cin >> n;
    V<string> vs(n + 1);
    for(int i = 1; i <= n; i++) cin >> vs[i];
    V<int> s(1);
    V<int> bel(1);
    for(int i = 1; i <= n; i++) {
        for(auto x : vs[i]) {
            s.pb(x);
            bel.pb(i);
        }
        s.pb(-i);
        bel.pb(0);
    }

    SuffixArray sa(s);
    ini(n);
    V<array<int, 3>> E;
    for(int i = 1; i + 1 < s.size(); i++) {
        E.pb({sa.ht[i], bel[sa.sa[i]], bel[sa.sa[i + 1]]});
    }
    sort(all0(E), greater<array<int, 3>>());

    LL ans = 0;

    for(int i = 0; i < E.size(); i++) {
        auto [w, x, y] = E[i];
        if(x == 0 || y == 0) continue;
        if(par(x) == par(y)) continue;
        ans += w;
        mer(x, y);
    }
    cout << ans << endl;
}


int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
}