#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> pippi;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<61;
int iinf=1<<30;
double pi=3.14159265358979323846;
double pi2=pi/2.0;
double eps=1e-8;
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
//#define endl "\n"
int dh[4]={1,0,-1,0};
int dw[4]={0,1,0,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<int,int,custom_hash>
ll gcd(ll a,ll b){
    if(a<0)a=-a;
    if(b<0)b=-b;
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    if(k<0)return 0;
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
int n;
string s[200010];
struct e{
    int l,r,num;char ch;
};
vector<e> v;
void dfs(int l,int r,int num){
    //cout<<l<<" "<<r<<" "<<num<<endl;
    
    int nl=l;
    rep(i,l,r){
        
        if(s[i].size()==num+1){
            v.push_back((e){l,r,num,s[i][num]});
            dfs(nl,i,num+1);
            nl=i+1;
            //cout<<i<<" "<<0<<endl;
        }
        else{
            if(s[i][num]==s[nl][num]){}
            else{
               // if(num==0)cout<<nl<<" "<<i<<endl;
                dfs(nl,i,num+1);
                nl=i;
                //cout<<i<<" "<<2<<endl;
            }
        }
    }
    if(nl<r){
       // if(num==0)cout<<nl<<endl;
        dfs(nl,r,num+1);
    }
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int ma=0;
    cin>>n;
    rep(i,0,n){
        cin>>s[i];
        reverse(s[i].begin(),s[i].end());
        Max(ma,(int)(s[i].size()));
    }
    sort(s,s+n);
    dfs(0,n,0);
    vector<pair<int,char>> vv[n+1],ww[n+1];
    rep(i,0,v.size()){
        vv[v[i].l].push_back({v[i].num,v[i].ch});
        ww[v[i].r].push_back({v[i].num,v[i].ch});
    }
    int cnt[ma][26];
    memset(cnt,0,sizeof cnt);
    ll ans=0;
    int nc[26];
    rep(i,0,n){
        rep(j,0,ww[i].size()){
            cnt[ww[i][j].first][ww[i][j].second-'a']--;
        }
        rep(j,0,vv[i].size()){
            cnt[vv[i][j].first][vv[i][j].second-'a']++;
        }
        fill(nc,nc+26,0);
        rep(j,0,s[i].size()){
            rep(k,0,26)nc[k]+=cnt[j][k];
            ans+=nc[s[i][j]-'a'];
            nc[s[i][j]-'a']=0;
        }
    }
    ans-=n;
    cout<<ans<<endl;
}


Measured memory_bytes: 132216