#include <bits/stdc++.h>
#define ll long long
#define pir pair <ll, ll>
#define mkp make_pair
#define fi first
#define se second
#define pb push_back
using namespace std;
const ll maxn = 2e6 + 10;
struct node { int ch[26], fa, len; } a[maxn];
char s[maxn]; ll n, m, tot = 1, las, ans;
void ins(ll c) {
	ll p = las, q, nq;
	if(a[p].ch[c]) {
		q = a[p].ch[c];
		if(a[q].len == a[p].len + 1) las = q;
		else {
			nq = ++tot; a[nq] = a[q];
			a[q].fa = nq, a[nq].len = a[p].len + 1;
			for(; p && a[p].ch[c] == q; p = a[p].fa) a[p].ch[c] = nq;
			las = nq;
		} return;
	}
	ll np = las = ++tot;
	a[np].len = a[p].len + 1;
	for(; p && !a[p].ch[c]; p = a[p].fa) a[p].ch[c] = np;
	if(!p) a[np].fa = 1;
	else {
		q = a[p].ch[c];
		if(a[q].len == a[p].len + 1) a[np].fa = q;
		else {
			nq = ++tot; a[nq] = a[q];
			a[np].fa = a[q].fa = nq;
			a[nq].len = a[p].len + 1;
			for(; p && a[p].ch[c] == q; p = a[p].fa) a[p].ch[c] = nq;
		}
	}
}
int main(){
	scanf("%lld", &n);
	for(ll i = 1; i <= n; i++) {
		scanf("%s", s + 1); m = strlen(s + 1);
		las = 1;
		for(ll j = 1; j <= m; j++)
			ins(s[j] - 'a');
	}
	for(ll i = 2; i <= tot; i++)
		ans += a[i].len - a[a[i].fa].len;
	printf("%lld", ans);
	return 0;
}