#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i) 
#define R(i, j, k) for(int i = (j); i >= (k); --i) 
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size()) 
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 2e6 + 7;
int n, m;
char s[N];
int cnt[N];
int ch[N][26], fa[N], len[N], lst = 1, tot = 1;
void cpy(int x, int y) {
	memcpy(ch[y], ch[x], sizeof(int) * 26), fa[y] = fa[x], len[y] = len[x];
}
void ins(int x) {
	int p = lst, now = lst = ++tot;
	len[now] = len[p] + 1;
	for(; p && !ch[p][x]; p = fa[p]) ch[p][x] = now;
	if(!p) fa[now] = 1;
	else {
		int pto = ch[p][x];
		if(len[pto] == len[p] + 1) fa[now] = pto;
		else {
			int sp = ++tot;
			cpy(pto, sp), len[sp] = len[p] + 1;
			fa[pto] = fa[now] = sp;
			for(; p && ch[p][x] == pto; p = fa[p]) ch[p][x] = sp;
		}
	}
}

int q[N], c[N];
void qsort() {
	L(i, 1, tot) 
		c[len[i]] += 1;
	L(i, 1, tot) 
		c[i] += c[i - 1];
	L(i, 1, tot) 
		q[c[len[i]]--] = i;
	R(i, tot, 1) 
		cnt[fa[q[i]]] += cnt[q[i]];
}

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	while(n--) {
		string s;
		cin >> s;
		lst = 1;
		for(auto u : s) 
			ins(u - 'a');
	}
	qsort(); 
	ll ns = 0;
	L(i, 1, tot) 
		ns += len[i] - len[fa[i]];
	cout << ns << '\n';
	return 0;
}