#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< int , int >PII;
ostream &operator<<(ostream &out, const PII &p) {
  return out<<"("<<p.first<<","<<p.second<<")";
}
const int maxn = 4e6+5; ///NOTICE
const int N = maxn;
namespace DA {
  int wa[maxn],wb[maxn],wv[maxn],wc[maxn],r[maxn];
  int sa[maxn],rak[maxn],height[maxn],SIGMA=0;
  int cmp(int *r,int a,int b,int l) {
    return r[a] == r[b] && r[a+l] == r[b+l];
  }
  void da(int *r,int *sa,int n,int m) {
    int i,j,p,*x=wa,*y=wb,*t;
    for( i=0;i<m;i++) wc[i]=0;
    for( i=0;i<n;i++) wc[x[i]=r[i]]++;
    for( i=1;i<m;i++) wc[i] += wc[i-1];
    for( i= n-1;i>=0;i--)sa[--wc[x[i]]] = i;
    for( j= 1,p=1;p<n;j*=2,m=p){
      for(p=0,i=n-j;i<n;i++)y[p++] = i;
      for(i=0;i<n;i++)if(sa[i]>=j) y[p++]=sa[i]-j;
      for(i=0;i<n;i++)wv[i] = x[y[i]];
      for(i=0;i<m;i++) wc[i] = 0;
      for(i=0;i<n;i++) wc[wv[i]]++;
      for(i=1;i<m;i++) wc[i] += wc[i-1];
      for(i=n-1;i>=0;i--) sa[--wc[wv[i]]] = y[i];
      for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;i++)
        x[sa[i]]=cmp(y,sa[i-1],sa[i],j) ? p-1:p++;
    }
  }
  void calheight(int *r,int *sa,int n) {
    int i,j,k=0;
    for(i=1;i<=n;i++) rak[sa[i]] = i;
    for(i=0;i<n;height[rak[i++]] = k ) {
      for(k?k--:0,j=sa[rak[i]-1];
                              r[i+k]==r[j+k];k++);
    }
  }
  ///LCP[i] = LCP of (SA[i], SA[i + 1])
  void suffixArray(vector<int> &s,
      vector< int >&suffArray, vector< int >&lcp){
    int n = s.size(); SIGMA = 0;
    for(int i = 0; i < n; i ++) {
      r[i] = s[i];
      SIGMA = max(SIGMA, r[i]);
    }
    r[n] = 0; da(r, sa, n+1, SIGMA + 1);
    suffArray.resize(n);
    for(int i = 0; i<n; i++) suffArray[i]=sa[i+1];
    calheight(r,sa,n); lcp.resize(n-1);
    for (int i = 0; i+1<n; i++)lcp[i]=height[i+2];
  }
}

int p[N];
int f(int ind){
    return p[ind] = (p[ind] == ind ? ind : f(p[ind]));
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;
    vector<int> v;
    vector<int> pos;
    for(int i = 1; i <= n; i++){
        string s;
        cin >> s;
        for(auto x : s){
            v.push_back(x - 'a' + n + 5);
            pos.push_back(i);
        }
        v.push_back(i);
        pos.push_back(i);
    }

    vector<int> sa, lcp;
    DA::suffixArray(v, sa, lcp);

    vector<tuple<int, int, int>> ed;
    for(int i = 1; i < sa.size(); i++){
        if(pos[sa[i]] == pos[sa[i - 1]])continue;
        ed.emplace_back(lcp[i - 1], pos[sa[i]], pos[sa[i - 1]]);
    }
    sort(ed.rbegin(), ed.rend());
    for(int i = 1; i <= n; i++)p[i] = i;
    ll ans = 0;
    for(auto [d, x, y] : ed){
//        cout << d << ' ' << x << ' ' << y << endl;
        x = f(x);
        y = f(y);
        if(x != y){
            ans += d;
            p[x] = y;
        }
    }
    cout << ans << "\n";
    return 0;
}
/*
4 4
2 4 1 3
1
2
3
4
8 9
2 4 1 3 6 8 5 7
1 2 3 4 5 6 7 8 9
*/