// 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1000005;
int t[2][N],sum[N],n,len,ans,rt[N];
char s[N];
struct node {
	int val,op,lc,rc;
}tr[N<<2];int tot=0;
int newnode(int x,int y) {
	tr[++tot]=(node){x,y,0,0};
	return tot;
}
int merge(int x,int y) {
	if(!x||!y) return x+y;
	if(tr[x].val>tr[y].val) swap(x,y);
	if(rand()&1) swap(tr[x].lc,tr[x].rc);
	tr[x].lc=merge(tr[x].lc,y);
	return x;
}
void dfs(int p,int dep) {
	if(!p) return ;
	int o=0;
	if(t[0][p]) dfs(t[0][p],dep+1),rt[p]=merge(rt[p],rt[t[0][p]]),o++;
	if(t[1][p]) dfs(t[1][p],dep+1),rt[p]=merge(rt[p],rt[t[1][p]]),o++;
	if(o==0) rt[p]=merge(rt[p],newnode(dep+2,0));
	if(o==1) rt[p]=merge(rt[p],newnode(dep+1,1));
	if(o==0) sum[p]--;
	while(sum[p]) {
		node tmp=tr[rt[p]];
		rt[p]=merge(tr[rt[p]].lc,tr[rt[p]].rc);
		ans+=tmp.val-dep;
		rt[p]=merge(rt[p],newnode(tmp.val+1+tmp.op,0));
		if(!tmp.op)	
			rt[p]=merge(rt[p],newnode(tmp.val+1,0));
		sum[p]--;
	}
	return ;
}
signed main() {
	srand(114514);
	scanf("%d",&n);
	tot=1;
	for(int i=1;i<=n;i++) {
		scanf("%s",s);
		len=strlen(s);
		int p=1;
		for(int j=0;j<len;j++) {
			if(!t[s[j]-'0'][p]) t[s[j]-'0'][p]=++tot;
			p=t[s[j]-'0'][p];
		}
		++sum[p];
	}
	tot=0;
	dfs(1,0);
	printf("%lld\n",ans);
	return 0;
}