#include<bits/stdc++.h>
#define ll long long
#define pii make_pair
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
const ll inf = 1145141919810;
using namespace std;
inline ll read(){
    ll x=0,f=1;
    char c=getchar();
    while (c<'0' || c>'9'){
        if (c=='-')  f=-1;
        c=getchar();
    }
    while (c>='0' && c<='9'){
        x=x*10+c-'0';
         c=getchar();
    }
    return x*f;
}
inline void print(ll x){
	if(x < 0) putchar('-'), x = -x;
	if(x > 9) print(x / 10);
	putchar(x % 10 + '0');
	return ;
}
inline void pprint(ll x){print(x); puts("");}
//使用说明：
//sa rk下表都从0开始
//h代表的是排名这个和他后面的那个的lcp
//使用方法：转化成int数组
struct SA {
	int n;
	vector<int> sa, rk;
	vector<ll> h;
	SA(int *s, int _n) {
		n = _n;
		s[++n] = 200000000;
		sa.resize(n);
		h.resize(n - 1);
		rk.resize(n);
		iota(sa.begin(), sa.end(), 0);
		sort(sa.begin(), sa.end(), [&](int a, int b) {
			return s[a] < s[b];
		});
		rk[sa[0]] = 0;
		for (int i = 1; i < n; ++i) {
			rk[sa[i]] = rk[sa[i - 1]] + (s[sa[i]] != s[sa[i - 1]]);
		}
		int k = 1;
		vector<int> tmp, cnt(n);
		tmp.reserve(n);
		while (rk[sa[n - 1]] < n - 1) {
			tmp.clear();
			for (int i = 0; i < k; ++i) {
				tmp.push_back(n - k + i);
			}
			for (auto i : sa) {
				if (i >= k) {
					tmp.push_back(i - k);
				}
			}
			fill(cnt.begin(), cnt.end(), 0);
			for (int i = 0; i < n; ++i) {
				++cnt[rk[i]];
			}
			for (int i = 1; i < n; ++i) {
				cnt[i] += cnt[i - 1];
			}
			for (int i = n - 1; i >= 0; --i) {
				sa[--cnt[rk[tmp[i]]]] = tmp[i];
			}
			swap(rk, tmp);
			rk[sa[0]] = 0;
			for (int i = 1; i < n; ++i) {
				rk[sa[i]] = rk[sa[i - 1]] + (tmp[sa[i - 1]] < tmp[sa[i]] || sa[i - 1] + k == n || tmp[sa[i - 1] + k] < tmp[sa[i] + k]);
			}
			k *= 2;
		}
		for (int i = 0, j = 0; i < n; ++i) {
			if (rk[i] == 0) {
				j = 0;
				continue;
			}
			for (j -= j > 0; i + j < n && sa[rk[i] - 1] + j < n && s[i + j] == s[sa[rk[i] - 1] + j];)
				++j;
			h[rk[i] - 1] = j;
		}
	}
};

const int N = 4e6 + 7;
int fa[N];
int get(int x){
	return fa[x] == x ? x : fa[x] = get(fa[x]);
}
int pos[N << 1], cnt[N];
struct Node{
	int x, y;
	ll lcp;
	bool operator < (const Node o){
		return lcp > o.lcp;
	}
};
int s[N];
int main(){
	int n = read();
	srand(time(0));
	cnt[0] = 0;
	int m = 0, pt = 30;
	rep(i, 1, n){
		fa[i] = i;
		string t;
		cin >> t;
		s[m++] = ++pt;
		for(auto c:t){
			s[m++] = c - 'a' + 1;
		}
		
		cnt[i] = m;//cnt是每个分隔符的位置
		
		rep(j, cnt[i - 1] + 1, cnt[i] - 1) pos[j] = i;//表示时第几个串串
	}
	
	SA sa(s, m);//m代表长度
	
	vector<Node> ans;

	for(int i = 1; i < m; ++i){
		if(pos[sa.sa[i]] == 0 || pos[sa.sa[i - 1]] == 0) continue;
		ans.pb(Node{pos[sa.sa[i]], pos[sa.sa[i - 1]], sa.h[i - 1]});
	}

	sort(ans.begin(), ans.end());
	ll Ans = 0;
	for(auto x:ans){
		int fx = get(x.x), fy = get(x.y);
		if(fx == fy) continue;
		Ans += x.lcp;
		fa[fx] = fy;
	}
	pprint(Ans);
	return 0;
}