// MagicDark
#include <bits/stdc++.h>
#define link djfhjsdk
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 2e6 + 10;
int son[N][26], link[N], tot, len[N];
vector <int> v[N];
int extend(int p, int c) {
	if (son[p][c]) {
		int q = son[p][c];
		if (len[p] + 1 == len[q]) return q;
		int cl = ++tot;
		len[cl] = len[p] + 1;
		link[cl] = link[q];
		F(i, 0, 25) son[cl][i] = son[q][i];
		while (p && son[p][c] == q) {
			son[p][c] = cl;
			p = link[p];
		}
		link[q] = cl;
		return cl;
	}
	int nw = ++tot;
	len[nw] = len[p] + 1;
	while (p && !son[p][c]) {
		son[p][c] = nw;
		p = link[p];
	}
	if (!p) link[nw] = 1;
	else {
		int q = son[p][c];
		if (len[p] + 1 == len[q]) link[nw] = q;
		else {
			int cl = ++tot;
			len[cl] = len[p] + 1;
			link[cl] = link[q];
			F(i, 0, 25) son[cl][i] = son[q][i];
			while (p && son[p][c] == q) {
				son[p][c] = cl;
				p = link[p];
			}
			link[nw] = link[q] = cl;
		}
	}
	return nw;
}
ll ans;
signed main() {
	int n; cin >> n;
	tot = 1;
	F(_, 1, n) {
		string st; cin >> st;
		int num = 1;
		for (char i: st) num = extend(num, i - 'a');
	}
	F(i, 2, tot) ans += len[i] - len[link[i]];
	cout << ans;
	return 0;
}
/* why?
*/