#include <bits/stdc++.h>
using i64 = long long;

inline void chkmin(int &a, const int &b) {if (a > b)	a = b;}

constexpr int N = 5e6 + 10;
int tot;
struct node {
	int ch[2];
	int rec;
	int ec;
	int& operator [](const int &x) {
		return ch[x];
	}
} tr[N];
inline int newnode() {
	tot++;
	tr[tot][0] = tr[tot][1] = 0;
	tr[tot].ec = 0;
	tr[tot].rec = 1e9;
	return tot;
}
inline void pushup(int u) {
	if (!tr[u][0] && !tr[u][1])
		chkmin(tr[u].rec, 2);
	else if ((tr[u][0] || tr[u][1]) && !(tr[u][0] && tr[u][1]))
		chkmin(tr[u].rec, 1);
	else
		tr[u].rec = std::min(tr[tr[u][0]].rec, tr[tr[u][1]].rec) + 1;
}

std::string str;
int curlen = 0;
void insert(int &u, int len) {
	if (!u)	u = newnode();
	if (len >= curlen) {
		tr[u].ec++;
		return ;
	}
	insert(tr[u][str[len] - '0'], len + 1);
}

int rt;
int n;
int ans;

void movedown(int u) {
	if (!tr[u][0] && !tr[u][1]) {
		tr[u][0] = newnode();
		tr[u][1] = newnode();
		tr[tr[u][0]].rec = 2, tr[tr[u][1]].rec = 2;
	} else if (!tr[u][0]) {
		tr[u][0] = newnode();
		tr[tr[u][0]].rec = 2;
	} else if (!tr[u][1]) {
		tr[u][1] = newnode();
		tr[tr[u][1]].rec = 2;
	} else if (tr[tr[u][0]].rec < tr[tr[u][1]].rec) {
		movedown(tr[u][0]);
	} else {
		movedown(tr[u][1]);
	}
	pushup(u);
}

void dfs(int u) {
	if (tr[u][0])
		dfs(tr[u][0]);
	if (tr[u][1])
		dfs(tr[u][1]);
	// 如果已经是叶子, 清掉一个贡献
	if (tr[u].ec && !tr[u][0] && !tr[u][1])
		tr[u].ec--, tr[u].rec = 2;
	else
		pushup(u);
	while (tr[u].ec--) {
		ans += tr[u].rec;
		movedown(u);
	}
}

int main() {
#ifdef HeratinoNelofus
	freopen("input.txt", "r", stdin);
#endif
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cin >> n;
	for (int i = 1; i <= n; i++) {
		std::cin >> str;
		curlen = str.length();
		insert(rt, 0);
	}
	dfs(1);
	std::cout << ans << '\n';
	return 0;
}