// 
// clang-format off
#include<bits/extc++.h>
#define pb push_back
#define P make_pair
#define st first
#define nd second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define ctz(s) __builtin_ctzll(s)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll; 
typedef unsigned long long ull; 
typedef pair<int,int> pii; typedef pair<ll,int> pli; typedef pair<ll,ll> pll; typedef pair<int,ll> pil;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int mod=998244353;
inline int fp(int x,ll p=mod-2,int m=mod,int res=1){
	for(;p;p>>=1){if(p&1)res=1ll*res*x%m;x=1ll*x*x%m;}
	return res;
}
const int N=1e5+2;
const int M=1e6+2;
const int INF=0x3fffffff;
// clang-format on
int n;
string s;
int ans;
int son[M][2],tot=1;
int ed[M];
int cs[N];
inline void insert(){
	int u=1;
	for(int i=0;i<s.length();++i){
		int d=s[i]-'0';
		if(!son[u][d])son[u][d]=++tot;
		u=son[u][d];
	}
	++ed[u];
}
struct Node{ int cst,v,t; };
bool operator <(Node A,Node B){return A.cst > B.cst;};
__gnu_pbds::priority_queue<Node,less<Node>,pairing_heap_tag>q[M];
inline void dfs(int u,int dep){
	if(!u)return;
	int t1=son[u][0],t2=son[u][1];
	if(!t1 && !t2){
		ans+=cs[ed[u]];
		int t=__lg(ed[u])+1;
		q[u].push({t+dep+1,(1<<t)-ed[u],t});
		return ;
	}
	dfs(t1,dep+1),dfs(t2,dep+1);
	q[u].join(q[t1]),q[u].join(q[t2]);
	if(!t1 || !t2)q[u].push({1+dep,1,0});
	while(ed[u]){
		Node res=q[u].top();q[u].pop();
		if(res.v>ed[u]){
			res.v-=ed[u];
			ans += (res.cst-dep)*ed[u];
			ed[u]=0;
			q[u].push(res);
			continue;
		}
		ans += (res.cst-dep)*res.v;
		ed[u]-=res.v;
		res.cst += 1+(res.t==0);
		res.v=1<<res.t;
		++res.t;
		q[u].push(res);
	}
}
int main() {
    //freopen("data.in", "r", stdin);
    // freopen(".in","r",stdin);
    // freopen("myans.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;++i)cin>>s,insert();
	for(int i=2;i<N;++i)cs[i]=cs[i-1]+1+ceil(log2(i));
	//for(int i=1;i<=tot;++i)ans+=cs[ed[i]];
	dfs(1,0);
	cout<<ans;
    return 0;

}