// 
// clang-format off
#include<bits/stdc++.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;
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[N];
int ans;
int son[M][2],tot=1;
int ed[M];
inline void insert(int id){
	int u=1;
	for(int i=0;i<s[id].length();++i){
		int d=s[id][i]-'0';
		if(ed[u]){
			ed[son[u][d^1]=++tot]=ed[u];
			ans+=ed[u];
			ed[u]=0;
		}
		if(!son[u][d])son[u][d]=++tot;
		u=son[u][d];
	}
	++ed[u];
}
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[i];
	sort(s+1,s+n+1,[](string x,string y){return x.length()<y.length();});
	for(int i=1;i<=n;++i)insert(i);
	static ll res[N];
	for(int i=2;i<N;++i)res[i]=res[i-1]+1+ceil(log2(i));
	for(int i=1;i<=tot;++i)ans += res[ed[i]];
	cout<<ans;
    return 0;

}