#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=1e6+3;
int n;
char s[N];
int len[N<<1],F[N<<1],nxt[N<<1][26],lst=1,tt=1;
inline int insert(int c){
	int p=lst;
	if(nxt[p][c]){
		int q=nxt[p][c];
		if(len[q]==len[p]+1)return q;
		int x=++tt;len[x]=len[p]+1;
		F[x]=F[q],memcpy(nxt[x],nxt[q],sizeof nxt[x]);
		F[q]=x;
		for(;p&&nxt[p][c]==q;p=F[p])nxt[p][c]=x;
		return x;
	}
	int u=++tt;len[u]=len[p]+1;
	for(;p&&!nxt[p][c];p=F[p])nxt[p][c]=u;
	if(!p)F[u]=1;
	else{
		int q=nxt[p][c];
		if(len[q]==len[p]+1)F[u]=q;
		else{
			int x=++tt;len[x]=len[p]+1;
			F[x]=F[q],memcpy(nxt[x],nxt[q],sizeof nxt[x]);
			F[q]=F[u]=x;
			for(;p&&nxt[p][c]==q;p=F[p])nxt[p][c]=x;
		}
	}
	return u;
}
int main() {
    //freopen("data.in", "r", stdin);
    //freopen("myans.out","w",stdout);
	int m=read();
	rep(i,1,m){
		scanf("%s",s+1);n=strlen(s+1);
		lst=1;
		rep(i,1,n)lst=insert(s[i]-'a');
	}
	ll ans=0;
	rep(i,2,tt)ans+=len[i]-len[F[i]];
	cout<<ans;
    return 0;
}