//#define NDEBUG

#pragma region cp_template

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f) : f(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}
constexpr char eoln = '\n';
template <class T> T ceildiv(const T &l, const T &r) {
  return l / r + (l % r != 0 ? 1 : 0);
}

} // namespace n91

#pragma endregion cp_template

#include <array>
#include <map>
#include <memory>
#include <string>


namespace n91 {

void main_() {
  //*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize n = scan<usize>();
  std::vector<std::vector<usize>> s(n);
  for (auto &e : s) {
    std::string t;
    std::cin >> t;
    for (const auto &f : t) {
      e.push_back(f - 'a');
    }
  }
  struct node {
    std::array<usize, 26> next;
    std::array<usize, 26> count;
    node() {
      for (const usize i : rep(0, 26)) {
        next[i] = 0;
        count[i] = 0;
      }
    }
  };
  std::vector<node> g(1);
  for (auto &t : s) {
    std::vector<usize> stack;
    usize cur = 0;
    std::reverse(t.begin(), t.end());
    for (const auto e : t) {
      stack.push_back(cur);
      if (g[cur].next[e] == 0) {
        g[cur].next[e] = g.size();
        g.emplace_back();
      }
      cur = g[cur].next[e];
    }
    std::array<bool, 26> ext;
    for (const usize i : rep(0, 26)) {
      ext[i] = false;
    }
    std::reverse(t.begin(), t.end());
    for (const auto e : t) {
      ext[e] = true;
      cur = stack.back();
      stack.pop_back();
      for (const usize i : rep(0, 26)) {
        if (ext[i]) {
          g[cur].count[i] += 1;
        }
      }
    }
  }
  u64 ans = 0;
  for (auto &t : s) {
    usize cur = 0;
    std::reverse(t.begin(), t.end());
    const usize c = t.back();
    t.pop_back();
    for (const auto e : t) {
      cur = g[cur].next[e];
    }
    ans += g[cur].count[c];
  }
  std::cout << ans - n << eoln;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 449268