#include <bits/stdc++.h>
#define Re register int
#define LL long long
using namespace std;
const int MAXN=4e6+5;
int n;
char ch[MAXN];
struct extended_SAM {
	int tot;
	int link[MAXN], maxlen[MAXN];
	int ch[MAXN][26];
	//link[i]: 后缀链接
	//ch[i]: 状态转移数组
	extended_SAM() {
		tot = 1;
	}//根初始化为1
	int insert(int x, int last) 
	{
		if(ch[last][x]) 
		{
			int p = last, np = ch[p][x];
			if(maxlen[p] + 1 == maxlen[np]) return np; //即最初的特判1
			else 
			{
				int q = ++tot;
				maxlen[q] = maxlen[p] + 1;
				for (int i = 0; i < 26; i++) ch[q][i] = ch[np][i];
				while (p && ch[p][x] == np) ch[p][x] = q, p = link[p];
				link[q] = link[np];
				link[np] = q;
				return q;//即最初的特判2
			}
		}
		int p = last, np = ++tot;
		maxlen[np] = maxlen[last] + 1;
		while(p && !ch[p][x]) ch[p][x] = np, p = link[p];
		if(!p) link[np] = 1;
		else 
		{
			int q = ch[p][x];
			if(maxlen[p] + 1 == maxlen[q]) link[np] = q;
			else 
			{
				int nq = ++tot;
				maxlen[nq] = maxlen[p] + 1;
				for (int i = 0; i < 26; i++) ch[nq][i] = ch[q][i];
				while(p && ch[p][x] == q) ch[p][x] = nq, p=link[p];
				link[nq] = link[q];
				link[np] = link[q]= nq;
			}
		}
		return np;
	}
} SAM;
vector<int> g[MAXN], col[MAXN];
int prt[MAXN];
pair<int, int> a[MAXN];
int get_prt(int x) {
    if (x == prt[x]) return x;
    return prt[x] = get_prt(prt[x]);
}
int cr[MAXN];
int ans;
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) prt[i] = i;
    for(Re i=1;i<=n;++i){
        scanf("%s",ch+1);
        Re last=1;
        for(Re j=1;ch[j];++j)
        {
            last=SAM.insert(ch[j]-'a',last);
            col[last].push_back(i);
        }
    }
    for (int i = 1; i <= SAM.tot; i++) g[SAM.link[i]].push_back(i);
    for (int i = 1; i <= SAM.tot; i++) a[i] = make_pair(SAM.maxlen[i], i);
    sort(a + 1, a + SAM.tot + 1, [](pair<int, int> A, pair<int, int> B){
        return A.first > B.first;
    });
    vector<int> vex;
    int k = 0;
    for (int i = 1; i <= SAM.tot; i++) 
    {
        vex.clear();
        int u = a[i].second, val = a[i].first;
        for (int x : col[u]) vex.push_back(x);
        for (int x : g[u]) vex.push_back(cr[x]);
        for (int j = 1; j < vex.size(); j++)
        {
            int x = vex[j], y = vex[j - 1];
            int prtx = get_prt(x), prty = get_prt(y);
            if (prtx != prty) 
            {
                prt[prtx] = prty;
                ans += val;
                k++;
            }
        }
        if (vex.size() > 0) cr[u] = get_prt(vex[0]);
    }
    cout << ans;
    return 0;
}
/*
4
icpc
macau
regional 
contest

3
ababa 
babab 
aba
*/