//vanitas vanitatum et omnia vanitas
#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<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
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 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=2e6+5,lim=2e6+1;
int n,c[N][26],fin[N],fa[N],tot=1,dfn[N],tick,sz[N],lst[N],cnt[N],ans,pos[N];
vi s[N],t[N],p;
vp occ[N];

struct BIT {
  int s[N];
  int lb(int x) {return x&-x;}
  void add(int x,int y) {for(;x<=lim;x+=lb(x)) s[x]+=y;}
  int qry(int x,int y=0) {for(;x;x-=lb(x)) y+=s[x]; return y;}
} A,B;

int add(vi &s,int p=1) {
  int m=s.size();
  rep(i,0,m-1) {
    if(!c[p][s[i]]) c[p][s[i]]=++tot;
    p=c[p][s[i]];
  } return p;
}
void build() {
  queue<int>q; fa[1]=1;
  rep(i,0,25) if(c[1][i]) q.push(c[1][i]); else c[1][i]=1;
  rep(i,0,25) fa[c[1][i]]=1;
  while(!q.empty()) {
    int u=q.front(); q.pop();
    rep(i,0,25) {
      if(!c[u][i]) c[u][i]=c[fa[u]][i];
      else fa[c[u][i]]=c[fa[u]][i], q.push(c[u][i]);
    }
  } rep(i,2,tot) t[fa[i]].eb(i);
}
void dfs(int u) {
  dfn[u]=++tick, sz[u]=1;
  for(int v:t[u]) lst[v]=(fin[u]?u:lst[u]), dfs(v), sz[u]+=sz[v];
}
bool cmp(const pair<pii,pii> &a,const pair<pii,pii> &b) {
  return a.fi.se==b.fi.se?(a.fi.fi==b.fi.fi?abs(a.se.se)<abs(b.se.se):a.fi.fi<b.fi.fi):(a.fi.se>b.fi.se);
}

signed main() {
  n=read();
  rep(i,1,n) {
    static char ch[N]; scanf("%s",ch);
    int m=strlen(ch); s[i].resize(m);
    rep(j,0,m-1) s[i][j]=ch[j]-'a';
    fin[pos[i]=add(s[i])]=i;
  }
  build(); dfs(1);
  //rep(i,1,tot) cout<<i<<" "<<c[i][0]<<" "<<c[i][1]<<" "<<" "<<c[i][2]<<" "<<fa[i]<<endl;
  rep(i,1,n) {
    //cout<<"CALCULATING "<<i<<endl;
    int x=1, m=s[i].size(); vi ad;
    rep(j,0,m-1) {
      x=c[x][s[i][j]]; A.add(dfn[x],1); ad.eb(dfn[x]);
      int y=(fin[x]&&fin[x]!=i?x:lst[x]);
      int a=fin[y], b=fin[lst[y]];
      //cout<<"   "<<x<<" "<<dfn[x]<<" "<<a<<" "<<b<<endl;
      if(a) {
        if(!occ[a].size()) p.eb(a);
        occ[a].eb(j-s[a].size()+1,j);
      }
      if(b) {
        if(!occ[b].size()) p.eb(b);
        occ[b].eb(j-s[b].size()+1,j);
      }
    }
    vector<pair<pii,pii>> op; //l,r,id,opt
    for(int x:p) {
      //cout<<"Xp: "<<x<<endl;
      reverse(occ[x].begin(),occ[x].end());
      int roc=A.qry(dfn[pos[x]]+sz[pos[x]]-1)-A.qry(dfn[pos[x]]-1);
      op.eb(make_pair(occ[x][0],pii(x,0)));
      //cout<<"   "<<roc<<" "<<occ[x].size()<<" "<<endl;
      if(roc!=occ[x].size()) continue; int m=roc;
      rep(i,0,m-1) {
        pii p=occ[x][i]; op.eb(make_pair(p,pii(x,1)));
        if(i) p.se=occ[x][i-1].se, op.eb(make_pair(p,pii(x,-1)));
      }
    }
    for(int x:ad) A.add(x,-1); ad.clear();
    sort(op.begin(),op.end(),cmp);
    for(auto xx:op) {
      int l=xx.fi.fi+1, r=xx.fi.se, id=xx.se.fi, opt=xx.se.se;
      //cout<<l-1<<" "<<r<<" "<<id<<" "<<opt<<endl;
      if(opt==0) B.add(l,1), ad.eb(l);
      else {
        int p=B.qry(l); //cout<<"    "<<p<<endl;
        if(opt==1) cnt[id]+=p; else cnt[id]-=p;
      }
    }
    for(int x:ad) B.add(x,-1); ad.clear();
    for(int x:p) {
      //cout<<"    "<<x<<" "<<cnt[x]<<endl;
      if(cnt[x]==2) ans++; occ[x].clear(), cnt[x]=0;
    } p.clear();
  }
  printf("%d\n",ans);
  return 0;
}