#pragma comment(linker, "/STACK:512000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#ifdef AIM
#include <sys/resource.h>
#endif
using namespace std;

#define all(a) a.begin(), a.end()
typedef long long li;
typedef long double ld;
void solve(__attribute__((unused)) bool);
void precalc();
clock_t start;
#define FILENAME ""

int main() {
#ifdef AIM
  string s = FILENAME;
//    assert(!s.empty());
  freopen("/home/alexandero/ClionProjects/cryptozoology/input.txt", "r", stdin);
  //freopen("/home/alexandero/ClionProjects/cryptozoology/output.txt", "w", stdout);
#else
//    freopen(FILENAME ".in", "r", stdin);
//    freopen(FILENAME ".out", "w", stdout);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
#endif
    start = clock();
    int t = 1;
#ifndef AIM
  cout.sync_with_stdio(0);
  cin.tie(0);
#endif

#ifdef AIM
  const rlim_t kStackSize = 256 * 1024 * 1024;
  struct rlimit rl;
  int result;

  result = getrlimit(RLIMIT_STACK, &rl);
  if (result == 0)
  {
    if (rl.rlim_cur < kStackSize)
    {
      rl.rlim_cur = kStackSize;
      result = setrlimit(RLIMIT_STACK, &rl);
      if (result != 0)
      {
        fprintf(stderr, "setrlimit returned result = %d\n", result);
      }
    }
  }
#endif

  precalc();
  cout.precision(10);
  cout << fixed;
  //cin >> t;
  int testNum = 1;
  while (t--) {
      //cout << "Case #" << testNum++ << ": ";
      solve(true);
  }
  cout.flush();
#ifdef AIM1
    while (true) {
      solve(false);
  }
#endif

#ifdef AIM
  cout.flush();
  auto end = clock();

  usleep(10000);
  print_stats(end - start);
  usleep(10000);
#endif

    return 0;
}

template<typename T>
T binpow(T q, T w, T mod) {
    if (!w)
        return 1 % mod;
    if (w & 1)
        return q * 1LL * binpow(q, w - 1, mod) % mod;
    return binpow(q * 1LL * q % mod, w / 2, mod);
}

template<typename T>
T gcd(T q, T w) {
    while (w) {
        q %= w;
        swap(q, w);
    }
    return q;
}
template<typename T>
T lcm(T q, T w) {
    return q / gcd(q, w) * w;
}

template <typename T>
void make_unique(vector<T>& a) {
    sort(all(a));
    a.erase(unique(all(a)), a.end());
}

template<typename T>
void relax_min(T& cur, T val) {
    cur = min(cur, val);
}

template<typename T>
void relax_max(T& cur, T val) {
    cur = max(cur, val);
}

void precalc() {
}

//#define int li
//const int mod = 1000000007;

struct Node {
  array<int, 26> trans;
  array<int, 26> reachable;
  Node() {
    trans.fill(-1);
    reachable.fill(0);
  }
};

void solve(__attribute__((unused)) bool read) {
  int n;
  cin >> n;
  vector<string> data(n);
  vector<Node> bor;
  bor.emplace_back();
  vector<int> path;
  vector<char> was;
  for (int i = 0; i < n; ++i) {
    cin >> data[i];
    reverse(all(data[i]));
    int v = 0;
    path.clear();
    path.push_back(0);
    for (char c : data[i]) {
      int let = c - 'a';
      if (bor[v].trans[let] == -1) {
        bor[v].trans[let] = bor.size();
        bor.emplace_back();
      }
      v = bor[v].trans[let];
      path.push_back(v);
    }
    was.assign(26, false);
    for (int j = (int)data[i].length() - 1; j >= 0; --j) {
      int let = data[i][j] - 'a';
      if (was[let]) {
        continue;
      }
      was[let] = true;
      for (int pos = j; pos >= 0; --pos) {
        ++bor[path[pos]].reachable[let];
        //cout << "add v: " << v << " let: " << let << endl;
      }
    }
  }
  li res = -n;
  for (auto& s : data) {
    int v = 0;
    for (int i = 0; i + 1 < s.length(); ++i) {
      v = bor[v].trans[s[i] - 'a'];
    }
    res += bor[v].reachable[s.back() - 'a'];
  }
  cout << res << endl;

}

Measured memory_bytes: 223976