#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
constexpr bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
constexpr bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

ll n;
vs s;

ll okmin(ll id){
  string sid = s[id];
  sid.pop_back();
  auto cond = [&](ll mid) -> bool{
    return s[mid] < sid;
  };
  auto BS = [&](ll true_max, ll false_min){
    while(false_min - true_max > 1){
      ll mid = true_max + ((false_min - true_max) / 2);
      (cond(mid) ? true_max : false_min) = mid;
    }
    return false_min;
  };
  return BS(-1, n);
}
ll okmax(ll id){
  string sid = s[id];
  sid.pop_back();
  sid += '{';
  auto cond = [&](ll mid) -> bool{
    return s[mid] < sid;
  };
  auto BS = [&](ll true_max, ll false_min){
    while(false_min - true_max > 1){
      ll mid = true_max + ((false_min - true_max) / 2);
      (cond(mid) ? true_max : false_min) = mid;
    }
    return true_max;
  };
  return BS(-1, n);
}

vvvll cnt;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  cin >> n;
  s.resize(n);
  cnt.resize(26, vvll(n));
  rep(i, n){
    cin >> s[i];
    reverse(ALL(s[i]));
  }
  sort(ALL(s));
  dump(s);
  rep(i, n){
    rep(j, 26){
      cnt[j][i].resize(SZ(s[i])+1, 0);
      ll c = 0;
      rep(k, SZ(s[i])){
        if(j == s[i][k]-'a') c++;
        cnt[j][i][k+1] = c;
      }
    }
  }
  dump(cnt);
  ll ans = 0;
  rep(i, n){
    dump(okmin(i), okmax(i));
    repr(j, okmin(i), okmax(i)+1){
      if(j == i) continue;
      dump(i, j, s[i].back()-'a', SZ(s[i]), cnt[s[i].back()-'a'][j].back(), cnt[s[i].back()-'a'][j][SZ(s[i])-1]);
      ans += (cnt[s[i].back()-'a'][j].back() - cnt[s[i].back()-'a'][j][SZ(s[i])-1] > 0);
    }
  }
  print(ans);
}


Measured memory_bytes: 425504