#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
namespace Patakou {
const int N = 4114514;
int a[N], c[N], sa[N], height[N], rank[N], x[N], y[N], qwq[N];
int l[N], r[N];
int f1[N], f2[N];
char s[N];
pair<int, int> ovo[N];
int read() {
  int x;
  scanf("%d", &x);
  return x;
}
int get(int *f, int x) { return f[x] == x ? x : f[x] = get(f, f[x]); }
inline void SA(int n, int m) {
  for (int i = 1; i <= n; ++i) ++c[x[i] = a[i]];
  for (int i = 1; i <= m; ++i) c[i] += c[i - 1];
  for (int i = 1; i <= n; ++i) sa[c[x[i]]--] = i;
  for (int k = 1; k <= n; k <<= 1) {
    int p = 0;
    for (int i = n - k + 1; i <= n; ++i) y[++p] = i;
    for (int i = 1; i <= n; ++i)
      if (sa[i] > k) y[++p] = sa[i] - k;
    for (int i = 1; i <= m; ++i) c[i] = 0;
    for (int i = 1; i <= n; ++i) ++c[x[i]];
    for (int i = 1; i <= m; ++i) c[i] += c[i - 1];
    for (int i = n; i; --i) sa[c[x[y[i]]]--] = y[i];
    swap(x, y);
    p = 1;
    x[sa[1]] = 1;
    for (int i = 2; i <= n; ++i)
      x[sa[i]] = y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k]
                     ? p
                     : ++p;
    if (p == n) break;
    m = p;
  }
  for (int i = 1; i <= n; ++i) rank[sa[i]] = i;
  for (int i = 1, p = 0; i <= n; ++i) {
    if (rank[i] == 1) continue;
    if (p) --p;
    int j = sa[rank[i] - 1];
    while (a[i + p] == a[j + p]) ++p;
    height[rank[i]] = p;
  }
}
int QAQ() {
  int n = read();
  int tot = 0;
  int sigema='z';
  for (int i = 1; i <= n; ++i) {
    scanf("%s", s + 1);
    int len = strlen(s + 1);
    for (int j = 1; j <= len; ++j) a[++tot] = s[j], qwq[tot] = i;
    ++tot;
    a[tot]=++sigema;
    qwq[tot]=i;
  }
  SA(tot, sigema);
  for (int i = 2; i <= tot; ++i) {
    ovo[i].first = -height[i];
    ovo[i].second = i;
  }
  sort(ovo + 2, ovo + tot + 1);
/*
  for (int i = 1; i <= tot; ++i) printf("%c", (char)a[i]);
 putchar('\n');
  for (int i = 1; i <= tot; ++i) printf("%d", qwq[i]);
  putchar('\n');
  for (int i = 1; i <= tot; ++i) {
    for (int j = sa[i]; j <= tot; ++j) printf("%c", (char)a[j]);
    printf(" %d \n", height[i]);
  }
  putchar('\n');
*/
  for (int i = 2; i <= tot; ++i) ovo[i].first = -ovo[i].first;
  for (int i = 1; i <= tot; ++i) f1[i] = i, l[i] = r[i] = i;
  for (int i = 1; i <= n; ++i) f2[i] = i;
  long long ans = 0;

  for (int i = 2; i <= tot; ++i) {
    int lp = get(f1, ovo[i].second - 1);
    int rp = get(f1, ovo[i].second);
    if (r[rp] - l[rp] < r[lp] - l[lp]) swap(lp, rp);
    for (int j = l[lp]; j <= r[lp]; ++j) {
      if (get(f2, qwq[sa[j]]) != get(f2, qwq[sa[rp]])) {
  //      printf("(%d %d)", get(f2, qwq[sa[j]]), get(f2, qwq[sa[rp]]));
        ans += ovo[i].first;
        f2[get(f2, qwq[sa[j]])] = get(f2, qwq[sa[rp]]);
      }
    }
    r[rp] = max(r[rp], r[lp]);
    l[rp] = min(l[rp], l[lp]);
    f1[lp] = rp;
  }
  printf("%lld\n", ans);
  return 0;
}
}  // namespace Patakou
int main() { return Patakou::QAQ(); }