#include <bits/stdc++.h>
#define ll long long
#define db double
#define gc getchar
#define pc putchar
#define pb push_back

using namespace std;

namespace IO
{
    template <typename T>
    void read(T &x)
    {
        x = 0; bool f = 0; char c = gc();
        while(!isdigit(c)) f |= c == '-', c = gc();
        while(isdigit(c)) x = x * 10 + c - '0', c = gc();
        if(f) x = -x;
    }

    template <typename T, typename ...Args>
    void read(T &x, Args &...args) {read(x), read(args...);}

    template <typename T>
    void write(T x)
    {
        if(x < 0) pc('-'), x = -x;
        if(x > 9) write(x / 10);
        pc('0' + x % 10);
    }
}
using namespace IO;

const int N = 2e6 + 5;

int n;
char s[N];

int tot = 1, ch[N][26], par[N], len[N];

int insert(int c, int lst)
{
    if(ch[lst][c])
    {
        int p = lst, q = ch[p][c];
        if(len[q] == len[p] + 1) return q;
        int nq = ++tot;
        memcpy(ch[nq], ch[q], sizeof(ch[q]));
        len[nq] = len[p] + 1;
        par[nq] = par[q], par[q] = nq;
        while(p && ch[p][c] == q) ch[p][c] = nq, p = par[p];
        return nq;
    }
    int p = lst, np = ++tot;
    len[np] = len[p] + 1;
    while(p && !ch[p][c]) ch[p][c] = np, p = par[p];
    if(!p) return par[np] = 1, np;
    int q = ch[p][c];
    if(len[q] == len[p] + 1) par[np] = q;
    else
    {
        int nq = ++tot;
        memcpy(ch[nq], ch[q], sizeof(ch[q]));
        len[nq] = len[p] + 1;
        par[nq] = par[q], par[q] = par[np] = nq;
        while(p && ch[p][c] == q) ch[p][c] = nq, p = par[p];
    }
    return np;
}

int main()
{
    read(n);
    for(int i = 1; i <= n; i++)
    {
        scanf("%s", s + 1);
        int lst = 1, len = strlen(s + 1);
        for(int j = 1; j <= len; j++)
            lst = insert(s[j] - 'a', lst);
    }
    ll ans = 0;
    for(int i = 1; i <= tot; i++) ans += len[i] - len[par[i]];
    write(ans), pc('\n');
    return 0;
}
// A.S.