#include<bits/stdc++.h>
using namespace std;
int trie[300005][26],cnt[300005],tag[300005];int nw = 1;
string s[5005];int n;
void insert(string s){
	int now = 1;
	for(int  i =0;i<s.size();i++){
		if(!trie[now][s[i]-'A'])trie[now][s[i]-'A'] = ++nw;
		now = trie[now][s[i]-'A'];cnt[now]++;
	}return;
}int ans = 0;
void dfs(int now){
	for(int i =0;i<26;i++){
		if(trie[now][i])dfs(trie[now][i]),tag[now]+=tag[trie[now][i]];
	}if(now == 1)return;
	cnt[now]-=tag[now];
//	cout << now << " " << cnt[now] << endl;
	if(cnt[now]>=2)cnt[now]-=2,tag[now]+=2,ans+=2;
}
signed main(){
	cin >> n;
	for(int i = 1;i<=n;i++)cin >> s[i];
	for(int i = 1;i<=n;i++)reverse(s[i].begin(),s[i].end());
	for(int i = 1;i<=n;i++)insert(s[i]);
	dfs(1);cout << ans << endl;
	return 0;
}