// 

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
typedef long long LL;
int n, tot = 1, ch[1000010][2], cnt[1000010];
int insert(const string& s) {
  int u = 1;
  for (char c : s) {
    int& v = ch[u][c - '0'];
    if (!v) v = ++tot;
    u = v;
  }
  return u;
}
struct node {
  vector<int> q;
  node(std::initializer_list<int> il) : q(il) {}
  int& operator[](int i) { return q[i]; }
  int size() { return q.size(); }
  void push_front(int x) { q.insert(q.begin(), x); }
  void push_back(int x) { q.push_back(x); }
  void autoresize(int n) {
    if (++n > q.size()) q.resize(n);
  }
};
void merge(node& f, node& fr) {
  if (f.size() < fr.size()) swap(f, fr);
  f.autoresize(fr.size());
  for (int j = 0; j < fr.size(); j++) {
    f[j] += fr[j];
  }
}
LL fans = 0;
bool vis[1000010];
pair<node, node> dp(int u) {
  if (!u) return make_pair(node{}, node{1});
  assert(!vis[u]);
  vis[u] = true;
  auto ret = dp(ch[u][0]), retr = dp(ch[u][1]);
  if (!ch[u][0] && !ch[u][1]) {
    ret = make_pair(node{1}, node{});
    cnt[u] -= 1;
  } else {
    ret.first.push_front(0);
    ret.second.push_front(0);
    retr.first.push_front(0);
    retr.second.push_front(0);
    merge(ret.first, retr.first);
    merge(ret.second, retr.second);
  }
  for (int j = 0; cnt[u]; j++) {
    ret.first.autoresize(j);
    int tmp = 0;
    int& cl = j > 0 ? ret.first[j - 1] : tmp;
    ret.second.autoresize(j);
    int& ce = ret.second[j];
    debug("on node %d, j = %d, cnt = %d, cl = %d, ce = %d\n", u, j, cnt[u], cl,
          ce);
    int cst = min(ce, cnt[u]);
    fans += j * cst, cnt[u] -= cst, ce -= cst, ret.first[j] += cst;
    //  debug("fans += %d * %d, cst = %d, ce = %d now\n", j, cst, cst, ce);
    cst = min(cl, cnt[u]);
    fans += cst, cl -= cst, ret.first[j] += cst, ret.second[j] += cst;
    // debug("fans += %d, cst = %d, ce = %d now, cl = %d now\n", cst, cst, ce,
    // cl);
    ce = ret.second[j];
    cst = min(ce, cnt[u]);
    fans += j * cst, cnt[u] -= cst, ce -= cst, ret.first[j] += cst;
    // debug("fans += %d * %d, cst = %d, ce = %d now\n", j, cst, cst, ce);
  }
  ret.first.q.resize(20);
  ret.second.q.resize(20);
  return ret;
}
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);
#endif
  cin >> n;
  for (int i = 1; i <= n; i++) {
    string s;
    cin >> s;
    cnt[insert(s)] += 1;
  }
  dp(1);
  cout << fans << endl;
  return 0;
}