#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
constexpr int Max=2e6+10;
int cnt[Max],ch[Max][26],len[Max],fa[Max];
int node_cnt=1;
inline int insert(int p,const int &x)
{
	if(ch[p][x])
	{
		int q=ch[p][x];
		if(len[q]==len[p]+1)
			return q;
		else
		{
			int clone=++node_cnt;
			memcpy(ch[clone],ch[q],sizeof(ch[q]));
			fa[clone]=fa[q],len[clone]=len[p]+1,fa[q]=clone;
			for(;p&&ch[p][x]==q;p=fa[p])
				ch[p][x]=clone;
			return clone;
		}
	}
	int cur=++node_cnt;
	len[cur]=len[p]+1;
	for(;p&&!ch[p][x];p=fa[p])
		ch[p][x]=cur;
	if(!p)
		fa[cur]=1;
	else
	{
		int q=ch[p][x];
		if(len[q]==len[p]+1)
			fa[cur]=q;
		else
		{
			int clone=++node_cnt;
			memcpy(ch[clone],ch[q],sizeof(ch[q]));
			fa[clone]=fa[q],len[clone]=len[p]+1,fa[q]=fa[cur]=clone;
			for(;p&&ch[p][x]==q;p=fa[p])
				ch[p][x]=clone;
		}
	}
	return cur;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	int n;
	cin>>n;
	while(n--)
	{
		string str;
		cin>>str;
		int p=1;
		for(auto x:str)
			p=insert(p,x-'a');
	}
	ll ans=0;
	for(int i=1;i<=node_cnt;++i)
		ans+=len[i]-len[fa[i]];
	cout<<ans<<"\n";
	return 0;
}
/*#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
constexpr int Max=2e6+10;
int cnt[Max],ch[Max][26],len[Max],fa[Max];
int node_cnt=1;
inline int insert(int p,const int &x)
{
	if(ch[p][x])
	{
		int q=ch[p][x];
		if(len[q]==len[p]+1)
			return q;
		else
		{
			int clone=++node_cnt;
			memcpy(ch[clone],ch[q],sizeof(ch[q]));
			fa[clone]=fa[q],len[clone]=len[p]+1,fa[q]=clone;
			for(;p&&ch[p][x]==q;p=fa[p])
				ch[p][x]=clone;
			return clone;
		}
	}
		int p=1;
		for(auto x:str)
			p=insert(p,x-'a');
	}
	ll ans=0;
	for(int i=1;i<=node_cnt;++i)
		ans+=len[i]-len[fa[i]];
	cout<<ans<<"\n";
	return 0;
}*/