#include <set>
#include <map>
#include <list>
#include <queue>
#include <cmath>
#include <time.h>
#include <random>
#include <bitset>
#include <vector>
#include <cstdio>
#include <stdio.h>
#include <iomanip>
#include <assert.h>
#include <stdlib.h>
#include <memory.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define mk make_pair
#define fi first
#define se second

char buf[1 << 20],*p1,*p2;
inline char gc(){
	if (p1 == p2){
		p1 = buf;
		p2 = buf + fread(buf,1,1 << 20,stdin);
	}
	return p1 == p2 ? EOF : *p1++;
	// return getchar();
}

inline int read(){
	int t = 0,f = 1;
	register char c = gc();
	while (c < 48 || c > 57) f = (c == '-') ? (-1) : (f),c = gc();
	while (c >= 48 && c <= 57) t = (t << 1) + (t << 3) + (c ^ 48),c = gc();
	return f * t;
}

inline int reads(char *s){
	int t = 0;
	register char c = getchar();
	while (c < 'a' || c > 'z') c = gc();
	while (c >= 'a' && c <= 'z') s[++t] = c,c = gc();
	return t;
}

const int N = 1e6 + 3,V = 26;
int n;
char s[N];

namespace sam{
	const int NN = N << 1;
	int ncnt,lnk[NN],len[NN],ch[NN][V];
	void init() {ncnt = 1;}
	int ins(int lst,int c){
		if (ch[lst][c]){
			int q = ch[lst][c],p = lst;
			if (len[q] == len[p] + 1) return q;
			int clone = ++ncnt;len[clone] = len[p] + 1,lnk[clone] = lnk[q];
			lnk[q] = clone;
			for (int i = 0;i < V;i++) ch[clone][i] = ch[q][i];
			while (p && ch[p][c] == q) ch[p][c] = clone,p = lnk[p];
			return clone;
		}
		int cur = ++ncnt,p = lst;len[cur] = len[lst] + 1;
		while (p && !ch[p][c]) ch[p][c] = cur,p = lnk[p];
		if (!p) {lnk[cur] = 1;return cur;}
		int q = ch[p][c];
		if (len[q] == len[p] + 1) {lnk[cur] = q;return cur;}
		int clone = ++ncnt;len[clone] = len[p] + 1,lnk[clone] = lnk[q];
		lnk[q] = lnk[cur] = clone;
		for (int i = 0;i < V;i++) ch[clone][i] = ch[q][i];
		while (p && ch[p][c] == q) ch[p][c] = clone,p = lnk[p];
		return cur;
	}
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	// freopen("out.out","w",stdout);
#endif
	n = read();
	sam::init();
	for (int i = 1;i <= n;i++){
		int m = reads(s),lst = 1;
		for (int i = 1;i <= m;i++) lst = sam::ins(lst,s[i] - 'a');
	}
	ll ans = 0;
	for (int i = 2;i <= sam::ncnt;i++) ans += sam::len[i] - sam::len[sam::lnk[i]];
	printf("%lld\n",ans);
	return 0;
}