#include<bits/stdc++.h>
#define Yukinoshita namespace
#define Yukino std
using Yukinoshita Yukino;
int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') w=ch=='-'?-1:1,ch=getchar();
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int mxn=2e6+5;
struct node
{
	int link,nxt[26],len; 
}t[mxn];
int cnt=1,lst;
long long sum;
void ins(int c)
{
	int w=++cnt,p,q;
	t[w].len=t[lst].len+1;
	for(p=lst;p&&!t[p].nxt[c];p=t[p].link)
		t[p].nxt[c]=w;
	if(!p)
		t[w].link=1;
	else
	{
		q=t[p].nxt[c];
		if(t[p].len+1==t[q].len)
			t[w].link=q;
		else
		{
			int cl=++cnt;
			t[cl]=t[q],t[cl].len=t[p].len+1;
			for(;t[p].nxt[c]==q;p=t[p].link)
				t[p].nxt[c]=cl;
			t[q].link=t[w].link=cl;
		}
	}
	sum+=t[w].len-t[t[w].link].len;
	lst=w;
}
int main()
{
	int n=read();
	while(n--)
	{
		string s;
		cin>>s;
		lst=1;
		for(auto x:s)
			ins(x-'a');
	}
	cout<<sum;
}