#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
const int N = 1e6 + 5; 

int n; 
int ch[N][2], tot = 1, cnt[N], dep[N]; 
char a[N]; 
int ans = 0; 
__gnu_pbds::priority_queue<pair<int, int>, greater<pair<int, int>>> q[N]; 

void dfs(int x) {
    if (!ch[x][0] && !ch[x][1]) q[x].push({dep[x] + 2, 1}), --cnt[x]; 
    else if (!ch[x][0] || !ch[x][1]) q[x].push({dep[x] + 1, 2}); 

    for (int c = 0; c < 2; ++c) if (ch[x][c]) {
        dep[ch[x][c]] = dep[x] + 1; 
        dfs(ch[x][c]); 
        q[x].join(q[ch[x][c]]); 
    }

    while (cnt[x]--) {
        auto [v, id] = q[x].top(); q[x].pop(); ans += v - dep[x]; 
        if (id == 1) q[x].push({v + 1, 1}), q[x].push({v + 1, 1}); 
        else q[x].push({v + 2, 1}); 
    }
}

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n; 
    for (int i = 1; i <= n; ++i) {
        cin >> a + 1; 
        int m = strlen(a + 1), p = 1; 
        for (int j = 1; j <= m; ++j) {
            int c = a[j] - '0'; 
            if (!ch[p][c]) ch[p][c] = ++tot; 
            p = ch[p][c]; 
        }
        ++cnt[p]; 
    }
    dfs(1); 
    cout << ans << '\n'; 
    return 0;
}