#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int N = 2e6 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

namespace sam {

  int to[N << 1][26], fail[N << 1], len[N << 1], lst[N << 1], tot;

  int ins(int u, int c) {
    if (to[u][c]) {
      int v = to[u][c];
      if (len[v] == len[u] + 1) return v;
      int nv = ++ tot;
      fail[nv] = fail[v], len[nv] = len[u] + 1;
      rep(i, 0, 25) to[nv][i] = to[v][i];
      for (; u && to[u][c] == v; u = fail[u]) to[u][c] = nv;
      fail[v] = nv;
      return nv;
    }
    int p = ++ tot; len[p] = len[u] + 1;
    for (; u && !to[u][c]; u = fail[u]) to[u][c] = p;
    if (!u) return fail[p] = 1, p;
    int v = to[u][c];
    if (len[v] == len[u] + 1) return fail[p] = v, p;
    int nv = ++ tot;
    fail[nv] = fail[v], len[nv] = len[u] + 1;
    rep(i, 0, 25) to[nv][i] = to[v][i];
    for (; u && to[u][c] == v; u = fail[u]) to[u][c] = nv;
    fail[v] = fail[p] = nv;
    return p;
  }

}

namespace trie {

  int tot, son[N][26];

  void ins(string s) {
    int n = s.size();
    for (int i = 0, u = 1; i < n; ++ i) {
      if (!son[u][s[i] - 'a']) son[u][s[i] - 'a'] = ++ tot;
      u = son[u][s[i] - 'a'];
    }
  }

  void dfs(int u) {
    rep(i, 0, 25) if (son[u][i]) {
      sam::lst[son[u][i]] = sam::ins(sam::lst[u], i);
      dfs(son[u][i]);
    }
  }

}

int n, p[N << 1];
long long ans;
string s[N];
vector <int> id[N << 1];

int fa[N];

int get(int u) {
  return u == fa[u] ? u : fa[u] = get(fa[u]);
}

bool merge(int u, int v) {
  if (get(u) == get(v)) return false;
  fa[get(v)] = get(u);
  return true;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  cin >> n;
  rep(i, 1, n) cin >> s[i], fa[i] = i;
  sam::tot = sam::lst[1] = 1;
  trie::tot = 1;
  rep(i, 1, n) trie::ins(s[i]);
  trie::dfs(1);
  // pv(sam::tot);
  // pa(sam::len, 1, sam::tot);
  // pa(sam::fail, 1, sam::tot);
  rep(i, 1, n) {
    int u = 1;
    id[u].emplace_back(i);
    for (char c : s[i]) {
      // cout << "i, u = " << i << ' ' << u << endl;
      u = sam::to[u][c - 'a'];
      id[u].emplace_back(i);
    }
  }
  rep(i, 1, sam::tot) p[i] = i;
  sort(p + 1, p + sam::tot + 1, [&](int u, int v) {
    return sam::len[u] > sam::len[v];
  });
  // pa(p, 1, sam::tot);
  rep(i, 1, sam::tot) {
    int u = p[i];
    if (id[u].empty()) continue;
    // cout << "u, len[u] = " << u << ' ' << sam::len[u] << endl;
    // if (id[u].size() > 1) pv(id[u].size());
    int o = get(id[u][0]);
    for (int j : id[u]) {
      if (merge(o, j)) ans += sam::len[u];
    }
    id[sam::fail[u]].emplace_back(o);
  }
  cout << ans << endl;
  return 0;
}