// 
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define db double
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
const int N=2e6+5;
int n,trie[N][2],c[N],d[N],rt[N],tot=1,sz;
ll sm,sm0;
string str;
struct node{
	int dist,val,op,l,r;
}a[N];
int newnode(int val,int op){
	sz++,a[sz].dist=1,a[sz].op=op,a[sz].val=val;
	return sz;
}
int merge(int x,int y){
	if(!x||!y)return x+y;
	if(a[x].val>a[y].val||a[x].val==a[y].val&&a[x].op>a[y].op)swap(x,y);
	a[x].r=merge(a[x].r,y);
	if(a[a[x].l].dist<a[a[x].r].dist)swap(a[x].l,a[x].r);
	a[x].dist=a[a[x].r].dist+1;
	return x;
}
void dfs(int u){
	int l=trie[u][0],r=trie[u][1];
	if(!l&&!r){
		rt[u]=newnode(d[u],1),c[u]--;
	}
	else if(!l||!r){
		dfs(l+r),rt[u]=merge(rt[l+r],newnode(d[u],0));
	}
	else{
		dfs(l),dfs(r),rt[u]=merge(rt[l],rt[r]);
	}
	for(int i=1;i<=c[u];i++){
		int x=rt[u];
		//cout<<"find:"<<a[x].val<<" "<<a[x].op<<" "<<a[x].l<<" "<<a[x].r<<"\n";
		if(a[x].op==0)rt[u]=merge(merge(a[x].l,a[x].r),newnode(a[x].val+1,1));
		else rt[u]=merge(merge(a[x].l,a[x].r),merge(newnode(a[x].val+1,1),newnode(a[x].val+1,1)));
	}
}
void dfs0(int u){
	if(!u)return;
	//cout<<u<<" "<<a[u].val<<"\n";
	if(a[u].op==1)sm0+=a[u].val;
	dfs0(a[u].l),dfs0(a[u].r);
}
int main(){
    // freopen("data.in","r",stdin);
    // freopen("own.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>str;int it=1;sm+=str.size();
		for(int j=0;j<str.size();j++){
			int f=str[j]-'0';
			if(!trie[it][f])trie[it][f]=++tot,d[tot]=j+1;
			it=trie[it][f];
		}c[it]++;
	}
	dfs(1);
	dfs0(rt[1]);
	cout<<sm0-sm<<"\n";
}