#include <bits/stdc++.h>
using namespace std;

namespace IO {
	#if ONLINE_JUDGE
	#define getc() (IS == IT && (IT = (IS = ibuf) + fread(ibuf, 1, IL, stdin), IS == IT) ? EOF : *IS++)
	#else
	#define getc() getchar()
	#endif
	const int IL = 1 << 21, OL = 1 << 21;
	int olen = 0;
	char ibuf[IL], *IS = ibuf, *IT = ibuf, obuf[OL];
	inline int read() {
		register char ch = getc(); register int x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		return x * f;
	}
	inline double readdb() {
		register char ch = getc(); register double x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		if(ch == '.') {
			register double b = 0.1;
			ch = getc();
			while(isdigit(ch)) x += (ch - 48) * b, b *= 0.1, ch = getc();
		}
		return x * f;
	}
	inline int readstr(char *s) {
		register char ch = getc(); register int len = 0;
		while(!isalpha(ch)) ch = getc();
		while(isalpha(ch)) s[++len] = ch, ch = getc();
		return len;
	}
	inline void flush() { fwrite(obuf, 1, olen, stdout); olen = 0; }
	inline void putc(register char ch) { obuf[olen++] = ch; }
	template<class T>
	inline void write(register T x) {
		if(x < 0) obuf[olen++] = '-', x = -x;
		if(x > 9) write(x / 10);
		obuf[olen++] = x % 10 + 48;
	}
} using namespace IO;
const int N = 1e6 + 10;
int n;
char s[N];
int last = 1, tot = 1;
int val[N << 1], cnt[N], tmp[N << 1];
struct node {
	int nxt[26], len, link;
} st[N << 1];
void insert(int c) {
	if(st[last].nxt[c]) {
		int p = last, q = st[p].nxt[c], y;
		if(st[q].len == st[p].len + 1) last = q;
		else {
			st[y = ++tot] = st[q];
			st[y].len = st[p].len + 1;
			while(p && st[p].nxt[c] == q) st[p].nxt[c] = y, p = st[p].link;
			st[q].link = y;
			last = y;
		}
		return;
	}
	int p = last, x = last = ++tot;
	st[x].len = st[p].len + 1;
	val[x] = 1;
	while(p && !st[p].nxt[c]) st[p].nxt[c] = x, p = st[p].link;
	if(!p) st[x].link = 1;
	else {
		int q = st[p].nxt[c], y;
		if(st[q].len == st[p].len + 1) st[x].link = q;
		else {
			st[y = ++tot] = st[q];
			st[y].len = st[p].len + 1;
			while(p && st[p].nxt[c] == q) st[p].nxt[c] = y, p = st[p].link;
			st[x].link = st[q].link = y;
		}
	}
}
int main() {
	n = read();
	for(int i = 1; i <= n; i++) {
		int len = readstr(s);
		last = 1;
		for(int j = 1; j <= len; j++)
			insert(s[j] - 'a');
	}
	long long ans = 0;
	for(int i = 2; i <= tot; i++)
		ans += st[i].len - st[st[i].link].len;
	cout << ans;
	return 0;
}