#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
    int x = 0; bool op = 0;
    char c = getchar();
    while(!isdigit(c))op |= (c == '-'), c = getchar();
    while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return op ? -x : x;
}
const int N = 1e6 + 10;
int n, tot;
int son[N << 1][26], len[N << 1], fa[N << 1], pos[N];
char s[N];
void ins() {
    scanf("%s", s + 1);
    int m = strlen(s + 1), u = 0;
    for(int i = 1; i <= m; i++) {
        int c = s[i] - 'a';
        if(son[u][c] == 0)son[u][c] = ++tot;
        u = son[u][c];
    }
    return ;
}
int extend(int p, int c) {
    int cur = ++tot;
    len[cur] = len[p] + 1;
    while(p && son[p][c] == 0)son[p][c] = cur, p = fa[p];
    if(p == 0)return fa[cur] = 1, cur;
    int q = son[p][c];
    if(len[q] == len[p] + 1)return fa[cur] = q, cur;
    int cl = ++tot; len[cl] = len[p] + 1; fa[cl] = fa[q];
    memcpy(son[cl], son[q], sizeof(son[q]));
    fa[q] = fa[cur] = cl;
    while(p && son[p][c] == q)son[p][c] = cl, p = fa[p];
    return cur;
}
struct Node {
    int u, v, c;
    Node() {}
    Node(int u, int v, int c):u(u), v(v), c(c) {}
};
void build() {
    queue<int> q;
    pos[0] = tot = 1; q.push(0);
    vector<Node> A;
    while(q.empty() == false) {
        int u = q.front(); q.pop();
        for(int i = 0; i < 26; i++)if(son[u][i]) {
            A.pb(Node(u, son[u][i], i));
            q.push(son[u][i]);
        }
    }
    memset(son, 0, sizeof(son));
    for(auto t : A)pos[t.v] = extend(pos[t.u], t.c);
    return ;
}
int main() { 
    n = read();
    for(int i = 1; i <= n; i++)ins();
    build();
    ll ans = 0;
    for(int i = 2; i <= tot; i++)ans += len[i] - len[fa[i]];
    printf("%lld\n", ans, tot);
    return 0;
}