#include <bits/stdc++.h>
using namespace std;
struct SAM {
	struct node {
		int len, fa, nxt[26];
	} t[2000010];
	node& operator [] (int x) {return t[x];}
	int cnt;
	SAM() : cnt(1) {}
	int ins(int ch, int lst) {
		int p = lst, cur = ++cnt;
		t[cur].len = t[lst].len + 1;
		for (; p && !t[p].nxt[ch]; p = t[p].fa)
			t[p].nxt[ch] = cur;
		int q = t[p].nxt[ch];
		if (!q) t[cur].fa = 1;
		else if (t[q].len == t[p].len + 1) t[cur].fa = q;
		else {
			int r = ++cnt;
			t[r] = t[q], t[r].len = t[p].len + 1;
			for (; p && t[p].nxt[ch] == q; p = t[p].fa)
				t[p].nxt[ch] = r;
			t[q].fa = t[cur].fa = r;
		}
		return cur;
	}
} T;
vector<pair<char, int>> t[1000010];
int n, cnt = 1;
void ins(string s) {
	int now = 1;
	for (char ch : s) {
		int flag = 0;
		for (auto v : t[now])
			if (v.first == ch) flag = v.second;
		if (!flag) t[now].push_back({ch, flag = ++cnt});
		now = flag;
	}
}
string s[100010];
int lst[1000010];
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> s[i], ins(s[i]);
	queue<int> q;
	q.push(1), lst[1] = 1;
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (auto v : t[u])
			lst[v.second] = T.ins(v.first - 'a', lst[u]), q.push(v.second);
	}
	long long ans = 0;
	for (int i = 1; i <= T.cnt; i++)
		ans += T[i].len - T[T[i].fa].len;
	cout << ans << endl;
	return 0;
}