//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};
vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
template<long long iden, long long size>
struct Trie{
  struct Node{
    vector<ll>next,idx;
    vector<ll>al;
    ll num;
    Node():num(0){
       next.assign(size,-1);
       al.assign(size,0);
    }
  };
  vector<Node>data;
  Trie(){
    data.emplace_back();
  }
  void add(const string &s, ll id){
    ll pos=0;
    vector<bool>tmp(26);
    vector<ll>history;
    for(ll i=0;i<s.size();i++){
      history.PB(pos);
      ll c = s[i] - iden;
      if(data[pos].next[c]==-1){
        data[pos].next[c]=data.size();
        data.emplace_back();
      }
      data[pos].num++;
      pos = data[pos].next[c];
    }
    data[pos].num++;
    data[pos].idx.push_back(id);
    rrep(i,0,s.size()){
      if(!tmp[s[i]-iden]){
        data[history[i]].al[s[i]-iden]++;
        tmp[s[i]-iden]=true;
      }
    }
  }
  ll ret=0;
  void search(const string &s){
    ll pos=0;
    for(ll i=0;i+1<s.size();i++){
      ll c = s[i] - iden;
      if(data[pos].next[c]==-1)break;
      pos = data[pos].next[c];
    }
    ll nxt=s.back()-iden;
    //cout<<s spa str[pos]<<endl;
    //debug(data[pos].al,26);
    ret+=data[pos].al[nxt]-1;
  }
  vector<ll>v;
  void dfs(ll pos, ll d){
    for(ll i=0;i<size;i++){
      if(data[pos].next[i]!=-1){
        dfs(data[pos].next[i], d+1);
        rep(j,0,size)data[pos].al[j]+=data[data[pos].next[i]].al[j];
      }
    }
  }
  vector<string>str;
  void build_str(ll pos=0,string s=""){
    while(str.size()<=pos)str.push_back("");
    str[pos]=s;
    for(ll i=0;i<size;i++){
      if(data[pos].next[i]!=-1){
        build_str(data[pos].next[i],s+char(i+iden));
      }
    }
  }
};
using trie = Trie<'a',26>;
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<string>s(n);
  trie tri;
  
  rep(i,0,n){
    cin>>s[i];
    reverse(ALL(s[i]));
    tri.add(s[i],0);
  }
  //tri.build_str();
  tri.dfs(0,0);
  rep(i,0,n){
    tri.search(s[i]);
  }
  cout<<tri.ret<<endl;
  return 0;
}

Measured memory_bytes: 562080