// 
#include <bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define dFor(i,a,b) for(int i=(a);i>=(b);i--)
#define tomin(x,y) x=min(x,y)
#define tomax(x,y) x=max(x,y)
#define ll long long
#define db double
#define pb push_back
#define gc getchar
#define lll __int128
const int N=1e6+5,M=3e7+5;
ll read()
{
	ll x=0,y=1;
	char c=getchar();
	for(;!isdigit(c);c=getchar()) if(c=='-') y=0;
	for(;isdigit(c);c=getchar()) x=(x<<3)+(x<<1)+(c^48);
	return y?x:-x;
}
char getc()
{
	char c=getchar();
	for(;!isalpha(c);c=getchar()) ;
	return c;
}
int n;
int num[M];
int nxt[M][2];
int f[M];

int cnt;
char ch[N];
void ins(int len)
{
	int p=0;
	For(i,1,len)
	{
		int &v=nxt[p][ch[i]-'0'];
		if(!v) v=++cnt;
		p=v;
	}
	num[p]++;
}
#define ls nxt[u][0]
#define rs nxt[u][1]
void upd(int &u)
{
	if(!u) u=++cnt;
} 
int ans=0;
void solve(int &u)
{
//	cout<<u<<endl;
	ans++;
	if(!u) 
	{
		u=++cnt;
		num[u]=1;
		f[u]=2;
		return;
	}
//	cout<<u<<" "<<num[u]<<endl;
	if(num[u]==1)
	{
		ans+=2;
		upd(ls),upd(rs);
		f[ls]=f[rs]=2;
		num[ls]=num[rs]=1;
		num[u]=0;
		f[u]=3;
		return;
	}
	if(f[ls]<f[rs]) solve(ls);
	else solve(rs);
	f[u]=min(f[ls],f[rs])+1;
}
signed main()
{
	n=read();
	For(k,1,n)
	{
		scanf("%s",&ch[1]);
		ins(strlen(ch+1)); 
	}
	dFor(u,cnt,1)
	{
		if(num[u])
		{
			if(num[u]==1&&!ls&&!rs)
			{
				f[u]=2;
				continue;
			}
			For(j,1,num[u])
			{
//				cout<<f[ls]<<" "<<f[rs]<<endl;
				if(f[ls]<f[rs]) solve(ls);
				else solve(rs);
			}
			num[u]=0;
		}
		f[u]=min(f[ls],f[rs])+1;
	}
	printf("%d\n",ans);
	return 0;
}
/*

*/