// 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int SZ=1<<20;
char buf[SZ],*p1,*p2;
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,SZ,stdin),p1==p2)?EOF:*p1++)
ll read(){
	ll n=0; bool m=0;
	char c=gc();
	while(c<'0'||c>'9')m=c=='-',c=gc();
	while(c>='0'&&c<='9')n=(n<<3)+(n<<1)+(c^'0'),c=gc();
	return m?-n:n;
}
const int N=1e6+5;
int n,rt[2][N],a[N<<1],lc[N<<1],rc[N<<1],d[N<<1],cnt;
int newnode(int x){
	cnt++,a[cnt]=x,d[cnt]=1;
	return cnt;
}
void pushup(int u){
	if(d[lc[u]]<d[rc[u]])swap(lc[u],rc[u]);
	d[u]=d[rc[u]]+1;
}
int merge(int u,int v){
	if(!u||!v)return u|v;
	if(a[u]>a[v])swap(u,v);
	rc[u]=merge(rc[u],v),pushup(u);
	return u;
}
char s[N];
int c[2][N],dep[N],t[N],tot,ans;
void ins(){
	int u=0;
	for(int i=1;s[i];i++){
		int &v=c[s[i]^'0'][u];
		if(!v)v=++tot,dep[v]=dep[u]+1;
		u=v;
	}
	t[u]++,ans-=dep[u];
}
void solve(int u){
	if(!c[0][u]&&!c[1][u]){
		rt[1][u]=newnode(dep[u]),t[u]--,ans+=dep[u];
	}else{
		if(c[0][u]){
			solve(c[0][u]);
			rt[0][u]=merge(rt[0][u],rt[0][c[0][u]]);
			rt[1][u]=merge(rt[1][u],rt[1][c[0][u]]);
		}
		if(c[1][u]){
			solve(c[1][u]);
			rt[0][u]=merge(rt[0][u],rt[0][c[1][u]]);
			rt[1][u]=merge(rt[1][u],rt[1][c[1][u]]);
		}
		if(!(c[0][u]&&c[1][u]))rt[0][u]=merge(rt[0][u],newnode(dep[u]));
	}
	while(t[u]--){
		if(a[rt[0][u]]+1<a[rt[1][u]]+2){
			ans+=a[rt[0][u]]+1;
			int x=rt[0][u];
			rt[0][u]=merge(lc[x],rc[x]);
			a[x]++,lc[x]=rc[x]=0,d[x]=1,rt[1][u]=merge(rt[1][u],x);
		}else{
			ans+=a[rt[1][u]]+2;
			int x=rt[1][u],y=newnode(a[x]+1);
			rt[1][u]=merge(lc[x],rc[x]);
			a[x]++,lc[x]=rc[x]=0,d[x]=1,rt[1][u]=merge(rt[1][u],merge(x,y));
		}
	}
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%s",s+1),ins();
	a[0]=N,solve(0);
	printf("%d",ans);
	return 0;
}