#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 4e5+10;
int n;

namespace SAM{
	const int MAXN = 2e6+10,M = 26;
	int ch[MAXN][M],fa[MAXN],len[MAXN],tot;
	void Init(){ fa[0] = -1; }
	void ext(int p,int c){
		if(ch[p][c]){
			int q = ch[p][c];
			if(len[q] == len[p]+1)return;
			int r = ++tot; len[r] = len[p]+1; fa[r] = fa[q],fa[q] = r;
			rep(i,0,M-1)ch[r][i] = ch[q][i];
			while(p != -1 && ch[p][c] == q)ch[p][c] = r,p = fa[p];
			return;
		}
		int cur = ++tot; len[cur] = len[p]+1; 
		while(p != -1 && !ch[p][c])ch[p][c] = cur,p = fa[p];
		if(p == -1)return;
		int q = ch[p][c];
		if(len[q] == len[p]+1)fa[cur] = q;
		else{
			int r = ++tot; len[r] = len[p] + 1; fa[r] = fa[q],fa[q] = fa[cur] = r;
			rep(i,0,M-1)ch[r][i] = ch[q][i];
			while(p != -1 && ch[p][c] == q)ch[p][c] = r,p = fa[p];
		}
	}
}

int main(){
	SAM::Init();

	cin>>n;

	rep(i,1,n){
		string s; cin>>s; int len = s.length();
		int u = 0;
		rep(j,0,len-1){
			int c = s[j]-'a';
			SAM::ext(u,c);
			u = SAM::ch[u][c];
		}
	}

	ll ans = 0; rep(i,1,SAM::tot)ans += SAM::len[i] - SAM::len[SAM::fa[i]];

	cout<<ans<<endl;

    return 0;
}