// 
#include<bits/stdc++.h>
#include<ext/pb_ds/priority_queue.hpp>
#define lowbit(x) ((x)&-(x))
using namespace std;
using namespace __gnu_pbds;
using i128=__int128;
using pii=pair<int,int>;
using LL=long long;
const int N=100005,M=1000005;
int n,tot,ch[M][2],cnt[M],dep[M];
LL ans;
string s;
__gnu_pbds::priority_queue<pii,greater<pii>>q[M];
inline void add(string s) {
    int p=0;
    for (auto x:s) {
        if (!ch[p][x-'0']) ch[p][x-'0']=++tot,dep[tot]=dep[p]+1;
        p=ch[p][x-'0'];
    }
    cnt[p]++;
}
void dfs(int p) {
    int f=0;
    if (ch[p][0]) f++,dfs(ch[p][0]),q[p].join(q[ch[p][0]]);
    if (ch[p][1]) f++,dfs(ch[p][1]),q[p].join(q[ch[p][1]]);
    if (!f) {
        q[p].push({dep[p]+2,0});
        cnt[p]--;
    }
    if (f==1) {
        q[p].push({dep[p]+1,1});
    }
    while (cnt[p]--) {
        auto x=q[p].top();
        q[p].pop(),ans+=x.first-dep[p];
        if (x.second) q[p].push({x.first+2,0});
        else q[p].push({x.first+1,0}),q[p].push({x.first+1,0});
    }
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n;
    for (int i=1;i<=n;i++) {
        cin>>s;
        add(s);
    }
    dfs(0);
    cout<<ans;
    return 0;
}