//Shirasu Azusa 2024.7
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;  
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
  return x*w;
}

const int N=2.2e6+5;
char s[N];

namespace SufT {
  signed ch[N][28];
  signed l[N],link[N],st[N],n,s[N],now=1,r,last,tot=1,cc[N];
  int newn(int _s,int _l=N) {
    ++tot; l[tot]=_l, st[tot]=_s, link[tot]=1; return tot;
  }
  void init() {
    l[0]=N, tot=1;
  }
  void extend(int x) {
    s[++n]=x; r++; last=1;
    if(x>=26) cc[n]=n;
    for(;r;now==1?r--:now=link[now]) {
      while(r>l[ch[now][s[n-r+1]]])
        r-=l[now=ch[now][s[n-r+1]]];
      int v=ch[now][s[n-r+1]], c=s[st[v]+r-1];
      if(x==c||!v) {
        link[last]=now, last=now;
        if(!v) ch[now][s[n-r+1]]=newn(n-r+1); else break;
      } else {
        int u=newn(st[v],r-1);
        ch[u][c]=v, ch[u][x]=newn(n);
        st[v]+=r-1, l[v]-=r-1, ch[now][s[n-r+1]]=u;
        link[last]=u, last=u;
      }
    }
  }
  void getcc() {
    per(i,n,1) if(!cc[i]) cc[i]=cc[i+1];
  }
  int dfs(int u) {
    int res=0;
    rep(i,0,25) if(ch[u][i]) {
      int v=ch[u][i];
      int L=st[v], r=st[v]+l[v]-1;
      if(cc[L]<=r) {
        rep(j,0,25) ch[v][j]=0;
        l[v]=cc[L]-st[v];
        assert(l[v]>=0);
      } else {
        res+=dfs(v);
      }
      res+=l[v];
    } return res;
  }
}

signed main() {
  int n=read(); SufT::init();
  while(n--) {
    scanf("%s",s+1); int m=strlen(s+1);
    rep(i,1,m) SufT::extend(s[i]-'a');
    if(n) SufT::extend(26);
  }
  SufT::extend(27); SufT::getcc();
  assert(SufT::r==0);
  printf("%lld\n",SufT::dfs(1));
  return 0;
}