#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>

using namespace std;
typedef long long i64;

i64 ans = 0;
int n, ch[510005][26], tot = 0, cnt = 0;
int siz[500005], dfn[500005], lst[500005];
char s[500005];
bool e[510005];
vector<int> G[500005];

bool cmp(int x, int y) {
    return siz[x] < siz[y];
}

void dfs(int x, int fa) {
    if (e[x]) G[lst[x]].emplace_back(x), lst[x] = x;
    for (int i = 0; i < 26; ++i)
        if (ch[x][i]) lst[ch[x][i]] = lst[x], dfs(ch[x][i], lst[x]);
}

void dfs2(int x, int fa) {
    siz[x] = 1;
    for (int y : G[x]) {
        dfs2(y, x);
        siz[x] += siz[y];
    }
    sort(G[x].begin(), G[x].end(), cmp);
}

void dfs3(int x, int fa) {
    dfn[x] = ++cnt; ans += dfn[x] - dfn[fa];
    for (int y : G[x]) dfs3(y, x);
}

int main(void) {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        scanf("%s", s);
        reverse(s, s + strlen(s));
        int x = 0;
        for (int i = 0; s[i]; ++i) {
            int c = s[i] - 'a';
            if (!ch[x][c]) ch[x][c] = ++tot;
            x = ch[x][c];
        }
        e[x] = true;
    }
    dfs(0, 0);
    dfs2(0, 0);
    dfs3(0, 0);
    printf("%lld\n", ans);
    return 0;
}