#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = typename std::decay<T>::type::reverse_iterator;

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 17 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

struct node_t {
  const i32 index;
  std::array<i32, 26> child;
  std::array<i32, 26> count;
  node_t(i32 index): index(index) {
    child.fill(-1);
    count.fill(0);
  }
};


int main() {
  i32 N;
  std::cin >> N;
  std::vector<std::string> S(N);
  for (auto &x: S) {
    std::cin >> x;
    std::reverse(x.begin(), x.end());
  }
  std::vector<node_t> node;
  auto add_node = [&] {
    i32 res = node.size();
    node.push_back(node_t(res));
    return res;
  };
  const i32 root = add_node();
  for (auto &x: S) {
    auto str = x;
    i32 cur = root;
    std::vector<i32> path;
    for (auto c: str) {
      path.push_back(cur);
      if (node[cur].child[c - 'a'] == -1) {
        node[cur].child[c - 'a'] = add_node();
      }
      cur = node[cur].child[c - 'a'];
    }
    std::reverse(str.begin(), str.end());
    std::array<i32, 26> has{};
    for (auto c: str) {
      i32 idx = path.back();
      path.pop_back();
      has[c - 'a'] = 1;
      for (auto i: range(0, 26)) {
        node[idx].count[i] += has[i];
      }
    }
  }
  i32 ans = 0;
  for (auto &x: S) {
    const auto str = x.substr(0, x.size() - 1);
    i32 cur = root;
    for (auto c: str) {
      cur = node[cur].child[c - 'a'];
    }
    ans += node[cur].count[x.back() - 'a'];
  }
  std::cout << ans - N << '\n';
  return 0;
}


Measured memory_bytes: 228208