#include<bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long

const int N = 5005;
int n;
string s;
int t[N * 50][26];
int f[N * 50];
int cnt;

void ins() {
	int now = 0;
	for (auto x : s) {
		if (!t[now][x - 'A']) t[now][x - 'A'] = ++cnt;
		now = t[now][x - 'A'];
	}
	f[now]++;
}

int ans = 0;

void dfs(int u) {
	for (int i = 0; i < 26; i++) {
		if (t[u][i]) dfs(t[u][i]), f[u] += f[t[u][i]];
	}
	if (u && f[u] >= 2) f[u] -= 2, ans += 2;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> s;
		reverse(s.begin(), s.end());
		ins();
	}
	dfs(0);
	cout << ans;
	QwQ330AwA;
}