#include <bits/stdc++.h>
#define LL long long
#define sl(n) strlen(n)
#define endline puts("")
#define pii pair<int , int>
#define pr_q priority_queue
#define debug puts("DEBUG.")
using namespace std;
const int N = 1e6 + 10;
const int inf = ~0u >> 2;
namespace SAM
{
	struct node
	{
		int maxl,link;
		int tr[26];
	}G[N << 1];
	int lst = 1,tot = 1;
	void insert(int b)
	{
		int u = ++tot,p = lst;
		lst = u;
		G[u].maxl = G[p].maxl + 1;
		while( p && !G[p].tr[b] )
			G[p].tr[b] = u,p = G[p].link;
		if(!p)
			return G[u].link = 1,void();
		int q = G[p].tr[b];
		if(G[q].maxl == G[p].maxl + 1)
			return G[u].link = q,void();
		G[++tot] = G[q],G[tot].maxl = G[p].maxl + 1;
		G[u].link = G[q].link = tot;
		while(p && G[p].tr[b] == q)
			G[p].tr[b] = tot,p = G[p].link;
	}
}
using namespace SAM;
char s[N];
LL ans;
int m;
int main()
{
	cin >> m;
	while(m--)
	{
		scanf("%s" , s + 1);
		int n = sl(s + 1);
		lst = 1;
		for(int i = 1;i <= n;i++)
			insert(s[i] - 'a');
	}
	for(int i = 2;i <= tot;i++)
		ans += G[i].maxl - G[G[i].link].maxl;
	cout << ans << endl;
	return 0;
}