#include <bits/stdc++.h>

const int N = 1e6 + 5;

long long ans;

struct PAM {
  struct node {
    int next[26];
    int suf, len;
  } t[N];
  int tot, suff;

  std::vector<int> ver[N];
  int max[N];

  PAM() {
    tot = 2, suff = 1;
    t[1].len = -1, t[1].suf = 1;
    t[2].len = 0, t[2].suf = 1;
    ver[1].emplace_back(2);
  }

  void init() {
    suff = 1;
  }

  void insert(std::string &s, int pos) {
    int cur = suff, k = s[pos] - 'a';
    for (; s[pos - 1 - t[cur].len] != s[pos]; cur  = t[cur].suf);
    if (t[cur].next[k]) {
      suff = t[cur].next[k];
      return ;
    }
    suff = ++tot;
    t[cur].next[k] = tot;
    t[tot].len = t[cur].len + 2;
    max[tot] = 1;
    if (t[tot].len == 1) {
      t[tot].suf = 2;
      ver[t[tot].suf].emplace_back(tot);
      return ;
    }
    cur = t[cur].suf;
    for (; s[pos - 1 - t[cur].len] != s[pos]; cur = t[cur].suf);
    t[tot].suf = t[cur].next[k];
    ver[t[tot].suf].emplace_back(tot);
  }

  void dfs(const int u) {
    for (auto &&v : ver[u]) {
      dfs(v);
    }
    if (t[u].len > 0) {
      int fa = t[u].suf;
      if (t[fa].len == 0 || t[u].len % (t[u].len - t[fa].len) != 0) {
        // std::cout << u << ' ' << max[u] << '\n';
        ans += 1ll * max[u] * max[u];
      } else {
        max[fa] = std::max(max[u], t[u].len / (t[u].len - t[fa].len));
      }
    }
  }
} pam;

int main() {
  // freopen("in", "r", stdin);
  // freopen("out", "w", stdout);
  std::cin.tie(0)->sync_with_stdio(false);
  int n;
  std::cin >> n;
  for (int i = 1; i <= n; ++i) {
    std::string s;
    std::cin >> s;
    pam.init();
    for (int pos = 0; pos < s.length(); ++pos) {
      pam.insert(s, pos);
    }
  }
  pam.dfs(1);
  std::cout << ans << '\n';
  return 0;
}