#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x))
#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE
#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
//const ll MOD = (ll)1e9+7;
const ll MOD = 998244353;
const int INF = (ll)1e9+7;
const ll INFLL = (ll)1e18;
template<class t>
using vvector = vector<vector<t>>;
template<class t>
using vvvector = vector<vector<vector<t>>>;
template<class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}
template<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}
#ifdef DEBUG
#define debug(x) cout<<"LINE "<<__LINE__<<": "<<#x<<" = "<<x<<endl;
#else
#define debug(x) (void)0
#endif

namespace templates{
  ll modpow(ll x, ll b){
    ll res = 1;
    while(b){
      if(b&1)res = res * x % MOD;
      x = x * x % MOD;
      b>>=1;
    }
    return res;
  }

  ll modinv(ll x){
    return modpow(x, MOD-2);
  }

  bool was_output = false;
  template<class t>
  void output(t a){
    if(was_output)cout << " ";
    cout << a;
    was_output = true;
  }
  void outendl(){
    was_output = false;
    cout << endl;
  }
  ll in(){
    ll res;
    scanf("%lld", &res);
    return res;
  }

  template<class t>
  istream& operator>>(istream&is, vector<t>&x){
    for(auto &i:x)is >> i;
    return is;
  }

  template<class t, class u>
  istream& operator>>(istream&is, pair<t, u>&x){
    is >> x.first >> x.second;
    return is;
  }

  template<class t>
  void in(t&x){
    cin >> x;
  }

  template<class t>
  t in(){
    t res; cin >> res; return res;
  }

  template<class t>
  void out(t x){
    cout << x;
  }

  template<class t>
  vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){
    sort(line.begin(),line.end(),comp);
    return line;
  }

  template<class t>
  vector<t> reversed(vector<t> line){
    reverse(line.begin(),line.end());
    return line;
  }
}

using namespace templates;

vector<int> toints(string str){
    vector<int> res;
    foreach(i,str){
        res.emplace_back(i-'a');
    }
    return res;
}

class tree{
    public:
        class node{
            public:
                vector<int> contains;
                vector<node*> childs;
                node(){
                    contains.resize(26,0);
                    childs.resize(26,NULL);
                }
        };
        node *root;
        tree(){
            root = new node();
        }

        void add(node *n,vector<int> &line,vvector<bool> &has,int p){
            if(line.size()==p)return;
            rep(i,26){
                n->contains[i] += has[p][i];
            }
            if(n->childs[line[p]]==NULL){
                n->childs[line[p]] = new node();
            }
            add(n->childs[line[p]],line,has,p+1);
        }
        void add(vector<int> &line,vvector<bool> &has){
            add(root,line,has,0);
        }

        ll count(node *n,vector<int> &line,int p){
            if(p+1==line.size()){
                return n->contains[line[p]];
            }
            return count(n->childs[line[p]],line,p+1);
        }

        ll count(vector<int> &line){
            return count(root,line,0);
        }
};

ll func(){
    int n = in();
    vvector<int> line(n);
    vvvector<bool> has(n);

    tree t;

    rep(i,n){
        line[i] = toints(in<string>());
        has[i].resize(line[i].size(),vector<bool>(26,false));
        rep(j,line[i].size()){
            has[i][j][line[i][j]] = true;
            if(j){
                rep(k,26){
                    has[i][j][k] = has[i][j][k] || has[i][j-1][k];
                }
            }
        }
        reverse(all(line[i]));
        reverse(all(has[i]));
        t.add(line[i],has[i]);
    }

    ll res = 0;

    rep(i,n){
        res += t.count(line[i]);
    }

    res -= n;

    return res;
}

int main(){
    cout << func() << endl;
  return 0;
}


Measured memory_bytes: 469296