// 
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#define ls trie[x][0]
#define rs trie[x][1]
#define LL long long
#define pr pair <LL, int>
#define mr make_pair
using namespace std;
const int MAXN = 1e7 + 5;
char s[MAXN];
int n, tot = 1, trie[MAXN][2], flg[MAXN], dp[MAXN], F[MAXN], ans;
void read(int &x) {
	x = 0; bool f = 1; char c = getchar();
	for(; c < '0' || c > '9'; c = getchar()) if(c == '-') f = 0;
	for(; c >= '0' && c <= '9'; c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x = (f ? x : -x);
}
void ins() {
    int len = strlen(s + 1); int now = 1;
    for(int i = 1; i <= len; i ++) {
        int q = s[i] - '0';
        if(!trie[now][q]) trie[now][q] = ++ tot;
        now = trie[now][q];
    }
    flg[now] ++;
}
void update(int x) {
    if(flg[x] == 1 && !ls && !rs) {
        dp[x] = 3; return;
    }
    if(ls && rs) {
        dp[x] = min(dp[ls], dp[rs]) + 1;
        if(dp[ls] < dp[rs]) F[x] = 0;
        else F[x] = 1;
    }
    else if(!ls) dp[x] = 2, F[x] = 0;
    else dp[x] = 2, F[x] = 1;
}
int Move(int x) {
    if(flg[x] == 1 && !ls && !rs) {
        flg[x] = 0; ls = ++ tot; rs = ++ tot; flg[ls] = 1; flg[rs] = 1;
        dp[ls] = 3; dp[rs] = 3; dp[x] = 4;
        return 3;
    }
    if(ls && rs) {
        int t;
        if(F[x] == 0) t = Move(ls) + 1;
        else t = Move(rs) + 1;
        update(x); return t;
    }
    if(!ls) {
        ls = ++ tot; flg[tot] = 1; dp[ls] = 3; update(x); return 2;
    }
    rs = ++ tot; flg[tot] = 1; dp[rs] = 3; update(x); return 2;
}
void dfs(int x) {
    if(x == 0) return;
    dfs(ls); dfs(rs); update(x);
    if(flg[x] == 1 && ls == 0 && rs == 0) return;
    if(flg[x]) {
        for(int i = 1; i <= flg[x]; i ++) {
            int t = Move(x); //printf("|%d|", t);
            ans += t - 1;
        }
    }
}
int main() {
    // freopen("A.txt", "r", stdin);
    // freopen("B.txt", "w", stdout);
    read(n);
    for(int i = 1; i <= n; i ++) {
        scanf("%s", s + 1); ins();
    }
    dfs(1); printf("%d", ans);
    return 0;
}
/*
g++ -o IdentityTheftP IdentityTheftP.cpp -std=c++14 -O2 -fno-ms-extensions -Wconversion -Wshadow
./IdentityTheftP
*/