#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define int128 __int128
#define FOR(i, m, n) for(int i=(m);i<=(n);i++)
#define ROF(i, m, n) for(int i=(m);i>=(n);i--)
#define REP(i, n) for(int i=0;i<(n);i++)
#define BG(v) v.begin()
#define ED(v) v.end()
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) v.size()
#define FI(v) v.first
#define SE(v) v.second
#define func(v) function<v>
#define pb push_back
#define eb emplace_back
#define DFS func(void(int, int))
#define PII pair<int,int>
#define PLL pair<ll, ll> 
#define endl '\n'
const int INF = 1e9 + 7;
const ll LNF = 1e18 + 7;
const double EPS = 1e-8;
const int P = 998244353;
const int G = 3;
const int GI = 332748118;
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
void IOSinit() {
	ios :: sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
}
int fp(int x,int y) {
	int res = 1;
	for(;y;y >>= 1) {
		if(y & 1) res = (1ll * res * x) % P;
		x = (1ll * x * x) % P;
	}
	return res;
}
const int N = 1e6 + 5;
int n;
string s;
struct node {
	int len, link;
	map<char, int> nxt;
}st[N << 1];
int sz, lst;
void init() {
	st[1].len = 0;
	st[1].link = -1;
	lst = 1;
	sz = 1;
}
void extend(char x) {
	int cur = ++sz;
	st[cur].len = st[lst].len + 1;
	int p = lst;
	while(p != -1 && !st[p].nxt.count(x)) {
		st[p].nxt[x] = cur;
		p = st[p].link;
	}
	if(p == -1) {
		st[cur].link = 1;
	}
	else {
		int q = st[p].nxt[x];
		if(st[p].len + 1 == st[q].len) {
			st[cur].link = q;
		}
		else {
			int cln = ++sz;
			st[cln].len = st[p].len + 1;
			st[cln].nxt = st[q].nxt;
			st[cln].link = st[q].link;
			while(p != -1 && st[p].nxt[x] == q) {
				st[p].nxt[x] = cln;
				p = st[p].link;
			}
			st[q].link = st[cur].link = cln;
		}
	}
	lst = cur;
}
void solve() {
	cin >> n;
	init();
	REP(_, n) {
		lst = 1;
		cin >> s;
		for(char x : s) extend(x);
	}
	ll ans = 0;
	FOR(i, 2, sz) {
		ans += st[i].len - st[st[i].link].len;
	}
	cout << ans << endl;
}
int main() {
	IOSinit();
	solve();
	return 0;
}