#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define pv(a) cout << #a" = " << a << endl
#define pa(a, l, r) cout << #a" : "; rep(_, l, r) cout << a[_] << " \n"[_ == r]

using i64 = long long;

const int P = 998244353;
const int base1 = 131;
const int base2 = 13331;

const int N = 1e6 + 10;

int inc(int a, int b) {
  return (a += b) >= P ? a - P : a;
}

int dec(int a, int b) {
  return (a -= b) < 0 ? a + P : a;
}

int mul(int a, int b) {
  return (i64) a * b % P;
}

int n, m, pw1[N], pw2[N];
char s[N];
i64 ans;
struct str {
  char *s;
  int pre1[N], pre2[N];
  void init(char *_s) {
    s = _s, m = strlen(s + 1);
    rep(i, 1, m) {
      pre1[i] = inc(mul(pre1[i - 1], base1), s[i] - 'a' + 1);
      pre2[i] = inc(mul(pre2[i - 1], base2), s[i] - 'a' + 1);
    }
  }
  pair <int, int> calc(int l, int r) {
    int res1 = dec(pre1[r], mul(pre1[l - 1], pw1[r - l + 1]));
    int res2 = dec(pre2[r], mul(pre2[l - 1], pw2[r - l + 1]));
    return make_pair(res1, res2);
  }
} cur;
set <pair <int, int>> f[N];

int d[2 * N];
char t[2 * N];
void manacher() {
  rep(i, 1, 2 * m + 1) t[i] = i & 1 ? '#' : s[i >> 1];
  for (int l = 0, r = -1, i = 1; i <= 2 * m + 1; ++i) {
    d[i] = i <= r ? min(r - i + 1, d[l + r - i]) : 0;
    while (i - d[i] > 0 && i + d[i] <= 2 * m + 1 && t[i + d[i]] == t[i - d[i]]) {
      if (!(i - d[i] & 1)) {
        f[d[i] + 1].insert(cur.calc((i - d[i]) / 2, (i + d[i]) / 2));
      }
      ++d[i];
    }
    if (i + d[i] - 1 > r) l = i - d[i] + 1, r = i + d[i] - 1;
  }
}

int main() {
  pw1[0] = pw2[0] = 1;
  rep(i, 1, N - 5) {
    pw1[i] = mul(pw1[i - 1], base1);
    pw2[i] = mul(pw2[i - 1], base2);
  }
  scanf("%d", &n);
  rep(i, 1, n) {
    scanf("%s", s + 1);
    cur.init(s);
    manacher();
  }
  rep(i, 1, N - 5) {
    int coef1 = pw1[i], coef2 = pw2[i];
    for (auto it : f[i]) {
      int cnt = 1, val1, val2;
      tie(val1, val2) = it;
      int res1 = val1, res2 = val2;
      for (int j = i + i; j <= N - 5; j += i) {
        res1 = inc(mul(res1, coef1), val1);
        res2 = inc(mul(res2, coef2), val2);
        auto fk = make_pair(res1, res2);
        if (f[j].find(fk) != f[j].end()) {
          ++cnt;
          f[j].erase(fk);
        } else {
          break;
        }
      }
      ans += (i64) cnt * cnt;
    }
  }
  printf("%lld\n", ans);
  return 0;
}