#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>

typedef long long ll;
typedef double lf;
typedef __int128 LL;

using namespace std;

namespace FastIO
{
    const int MAXSIZE = 1 << 20;
    char buf[MAXSIZE], *p1, *p2;
    #define gc (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) ((x) == ' ' || (x) == '\n' || (x) == '\r' || (x) == '\t')
    template <typename T> void Read(T &x)
    {
        x = 0; char ch = gc; bool f = 0;
        while (ch < '0' || ch > '9') {if (ch == '-') f = 1; ch = gc;}
        while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ 48), ch = gc;
        if (f) x = -x;
    }
    void Read(char *s)
    {
        char ch = gc;
        while (blank(ch)) ch = gc;
        while (!blank(ch)) *s++ = ch, ch = gc;
        *s = 0;
    }
}

using namespace std;
using FastIO::Read;

const int MAXN = 2e6 + 10;

int n; char s[MAXN];

queue <pair <int, int>> q;
int tr[MAXN][26], lk[MAXN], len[MAXN], tot, lst;
inline void Append(int c)
{
    int cur = tr[lst][c], p = lk[lst];
    len[cur] = len[lst] + 1;
    while (~p && !tr[p][c]) tr[p][c] = cur, p = lk[p];
    if (p == -1) return lk[cur] = 0, void();
    int q = tr[p][c];
    if (len[q] == len[p] + 1) return lk[cur] = q, void();
    int cl = ++tot;
    len[cl] = len[p] + 1, lk[cl] = lk[q], lk[q] = lk[cur] = cl;
    for (int i = 0; i < 26; i++)
        if (len[tr[q][i]]) tr[cl][i] = tr[q][i];
    while (~p && tr[p][c] == q) tr[p][c] = cl, p = lk[p];
}

int main()
{
    // freopen("5.in", "r", stdin);
    ios::sync_with_stdio(0), cin.tie(0);
    Read(n);
    for (int i = 1; i <= n; i++)
    {
        Read(s + 1); int m = strlen(s + 1);
        int cur = 0;
        for (int j = 1; j <= m; j++)
        {
            int c = s[j] - 'a';
            if (!tr[cur][c]) tr[cur][c] = ++tot;
            cur = tr[cur][c];
        }
    }
    lk[0] = -1;
    for (int i = 0; i < 26; i++)
        if (tr[0][i]) q.push(make_pair(0, i));
    while (!q.empty())
    {
        auto u = q.front(); q.pop();
        lst = u.first, Append(u.second), lst = tr[u.first][u.second];
        for (int i = 0; i < 26; i++)
            if (tr[lst][i]) q.push(make_pair(lst, i));
    }
    ll ans = 0;
    for (int i = 1; i <= tot; i++) ans += len[i] - len[lk[i]];
    cout << ans << '\n';
    return 0;
}