#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


////////////////////////////////////////////////////////////////////////////////
// SA-IS
//   String: string, vector<int>, vector<long long>
//   if sigma <= n,  O(n) time, O(n) space
//   if sigma >  n,  O(n log n) time, O(n) space
template <class String> vector<int> suffixArrayRec(const String &as) {
  const int n = as.size();
  if (n == 0) return {};
  const auto minmaxA = minmax_element(as.begin(), as.end());
  const auto minA = *minmaxA.first, maxA = *minmaxA.second;
  if (static_cast<unsigned long long>(maxA) - minA >=
      static_cast<unsigned long long>(n)) {
    vector<int> us(n);
    for (int u = 0; u < n; ++u) us[u] = u;
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (as[u] < as[v]);
    });
    int b = 0;
    vector<int> bs(n, 0);
    for (int i = 1; i < n; ++i) {
      if (as[us[i - 1]] != as[us[i]]) ++b;
      bs[us[i]] = b;
    }
    return suffixArrayRec(bs);
  }
  const int sigma = maxA - minA + 1;
  vector<int> pt(sigma + 1, 0), poss(sigma);
  for (int u = 0; u < n; ++u) ++pt[as[u] - minA + 1];
  for (int a = 0; a < sigma; ++a) pt[a + 1] += pt[a];
  // cmp[u] := (as[u, n) < as[u + 1, n))
  vector<bool> cmp(n);
  cmp[n - 1] = false;
  for (int u = n - 1; --u >= 0; ) {
    cmp[u] = (as[u] != as[u + 1]) ? (as[u] < as[u + 1]) : cmp[u + 1];
  }
  // ><,  nn - id (0 <= id < n)
  int nn = 0;
  vector<int> ids(n, 0);
  int last = n;
  vector<int> nxt(n, 0);
  // put ><, from the tail of each bucket
  vector<int> us(n, 0);
  memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
  for (int u = n - 1; --u >= 1; ) if (!cmp[u - 1] && cmp[u]) {
    ids[u] = ++nn;
    nxt[u] = last;
    last = u;
    us[--poss[as[u] - minA]] = u;
  }
  // follow > backwards, from the head of each bucket
  memcpy(poss.data(), pt.data(), sigma * sizeof(int));
  us[poss[as[n - 1] - minA]++] = n - 1;
  for (int i = 0; i < n; ++i) {
    const int u = us[i];
    if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
  }
  // follow < backwards, from the tail of each bucket
  memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
  for (int i = n; --i >= 0; ) {
    const int u = us[i];
    if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
  }
  if (nn) {
    int vsLen = 0;
    vector<int> vs(nn);
    for (const int u : us) if (ids[u]) vs[vsLen++] = u;
    int b = 0;
    vector<int> bs(nn, 0);
    for (int j = 1; j < nn; ++j) {
      // as[v1, w1] (< or =) as[v0, w0]
      int v1 = vs[j - 1], v0 = vs[j];
      const int w1 = nxt[v1], w0 = nxt[v0];
      if (w1 - v1 != w0 - v0) {
        ++b;
      } else {
        for (; ; ++v1, ++v0) {
          if (v1 == n) { ++b; break; }
          if (as[v1] != as[v0]) { ++b; break; }
          if (v1 == w1) break;
        }
      }
      bs[nn - ids[vs[j]]] = b;
    }
    for (int u = 0; u < n; ++u) if (ids[u]) vs[nn - ids[u]] = u;
    const auto sub = suffixArrayRec(bs);
    // put ><, from the tail of each bucket
    memset(us.data(), 0, n * sizeof(int));
    memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
    for (int j = nn; --j >= 0; ) {
      const int u = vs[sub[j]];
      us[--poss[as[u] - minA]] = u;
    }
    // follow > backwards, from the head of each bucket
    memcpy(poss.data(), pt.data(), sigma * sizeof(int));
    us[poss[as[n - 1] - minA]++] = n - 1;
    for (int i = 0; i < n; ++i) {
      const int u = us[i];
      if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
    }
    // follow < backwards, from the tail of each bucket
    memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
    for (int i = n; --i >= 0; ) {
      const int u = us[i];
      if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
    }
  }
  return us;
}

// us[i]: i-th suffix
// su[u]: index of as[u, n)
// hs[i]: longest common prefix of as[us[i - 1], n) and as[us[i], n)
struct SuffixArray {
  int n;
  bool rmq;
  vector<int> us, su, hs, bsr;
  SuffixArray() : n(0), rmq(false) {}
  SuffixArray(const string &as, bool rmq_) : rmq(rmq_) { build(as); }
  SuffixArray(const vector<int> &as, bool rmq_) : rmq(rmq_) { build(as); }
  SuffixArray(const vector<long long> &as, bool rmq_) : rmq(rmq_) { build(as); }
  template <class String> void build(const String &as) {
    n = as.size();
    us = suffixArrayRec(as);
    su.resize(n + 1);
    for (int i = 0; i < n; ++i) su[us[i]] = i;
    su[n] = -1;
    hs.assign(n, 0);
    for (int h = 0, u = 0; u < n; ++u) if (su[u]) {
      for (int v = us[su[u] - 1]; v + h < n && as[v + h] == as[u + h]; ++h) {}
      hs[su[u]] = h;
      if (h) --h;
    }
    if (rmq) {
      const int logN = n ? (31 - __builtin_clz(n)) : 0;
      hs.resize((logN + 1) * n - (1 << logN) + 1);
      for (int e = 0; e < logN; ++e) {
        int *hes = hs.data() + e * n;
        for (int i = 0; i <= n - (1 << (e + 1)); ++i) {
          hes[n + i] = min(hes[i], hes[i + (1 << e)]);
        }
      }
      bsr.resize(n + 1);
      bsr[0] = -1;
      for (int i = 1; i <= n; ++i) bsr[i] = bsr[i >> 1] + 1;
    }
  }
  // Returns longest common prefix of as[u, n) and as[v, n).
  //   0 <= u, v <= n
  //   Assumes rmq.
  inline int lcp(int u, int v) const {
    if (u == v) return n - u;
    int i = su[u], j = su[v];
    if (i > j) swap(i, j);
    const int e = bsr[j - i];
    return min(hs[e * n + i + 1], hs[e * n + j + 1 - (1 << e)]);
  }
};
////////////////////////////////////////////////////////////////////////////////


template <int SIZE_, char OFFSET_> struct Eertree {
  static constexpr int SIZE = SIZE_;
  static constexpr char OFFSET = OFFSET_;
  string s;
  int n;
  vector<int> us, len, fail;
  vector<int> nxt;
  Eertree(const string &s_) : s(s_) {
    n = s.size();
    us.assign(n + 3, 0);
    len.assign(n + 3, 0);
    fail.assign(n + 3, 0);
    nxt.assign((n + 3) * SIZE, 0);
    us[1] = 1; len[1] = -1; fail[1] = 1;
    us[2] = 2; len[2] =  0; fail[2] = 1;
    for (int i = 0; i < n; ++i) {
      const int c = s[i] - OFFSET;
      int u = us[i + 2];
      for (; !isSuffix(i, u); u = fail[u]) {}
      if (!nxt[u * SIZE + c]) {
        nxt[u * SIZE + c] = i + 3;
        len[i + 3] = len[u] + 2;
        if (u == 1) {
          fail[i + 3] = 2;
        } else {
          int v = fail[u];
          for (; !isSuffix(i, v); v = fail[v]) {}
          fail[i + 3] = nxt[v * SIZE + c];
        }
      }
      us[i + 3] = nxt[u * SIZE + c];
    }
  }
  bool isSuffix(int i, int u) const {
    const int j = i - 1 - len[u];
    return (j >= 0 && s[j] == s[i]);
  }
  void dfsPrint(int u, const string &prefix, int type) const {
    printf("%s%s%s %d %d\n",
           prefix.c_str(),
           ((type == 0) ? "" : (type == 1) ? "|-- " : "`-- "),
           ((len[u] <= 0) ? ("(" + to_string(len[u]) + ")")
                          : s.substr(u - 2 - len[u], len[u])).c_str(),
           u,
           fail[u]);
    vector<int> vs;
    for (int c = 0; c < SIZE; ++c) {
      const int v = nxt[u * SIZE + c];
      if (v) vs.push_back(v);
    }
    for (const int v : vs) {
      dfsPrint(v, prefix + ((type == 0) ? "" : (type == 1) ? "|   " : "    "),
               (v == vs.back()) ? 2 : 1);
    }
  }
  void print() const {
    dfsPrint(1, "", 0);
    dfsPrint(2, "  ", 0);
  }
};

////////////////////////////////////////////////////////////////////////////////


void experiment() {
  // min period
  auto factor = [&](const string &s) -> string {
    int n = s.size();
    for (int m = 1; m <= n; ++m) if (n % m == 0) {
      bool ok = true;
      // for (int i = 0, j = m - 1; i < j; ++i, --j) ok = ok && (s[i] == s[j]);
      for (int i = 0; i < n; ++i) ok = ok && (s[i] == s[i % m]);
      if (ok) {
        return s.substr(0, m);
      }
    }
    assert(false);
  };
  
  vector<string> pals;
  for (int n = 1; n <= 10; ++n) {
    for (int p = 0; p < 1 << (2 * n); ++p) {
      string s;
      for (int i = 0; i < n; ++i) s += (char)('a' + (p >> (2 * i) & 3));
      bool ok = true;
      for (int i = 0, j = n - 1; i < j; ++i, --j) ok = ok && (s[i] == s[j]);
      if (ok) pals.push_back(s);
    }
  }
cerr<<"|pals| = "<<pals.size()<<endl;
  for (const string &s : pals) for (const string &t : pals) {
    const string st = s + t;
    bool ok = true;
    for (int i = 0, j = (int)st.size() - 1; i < j; ++i, --j) ok = ok && (st[i] == st[j]);
    if (ok) {
      const string ss = factor(s);
      const string tt = factor(t);
      cout << s << " " << t << ": " << ss << " " << tt << endl;
      assert(ss == tt);
    }
  }
}


constexpr int LIM = 2'000'010;
int lpf[LIM];

char buf[LIM];

int N;
vector<int> pt;
string S;

int main() {
  // experiment();
  
  iota(lpf, lpf + LIM, 0);
  for (int p = 2; p < LIM; ++p) if (lpf[p] == p) {
    for (int n = 2 * p; n < LIM; n += p) chmin(lpf[n], p);
  }
  
  for (; ~scanf("%d", &N); ) {
    pt.clear();
    S = "";
    for (int i = 0; i < N; ++i) {
      scanf("%s", buf);
      pt.push_back((int)S.size());
      S += buf;
      S += '`';
    }
    pt.push_back((int)S.size());
// cerr<<"pt = "<<pt<<endl;
// cerr<<"S = "<<S<<endl;
    
    // Depam<char, 27, '`'> pam(0, pt[N]);
    // for (const char c : S) {
      // pam.pushBack(c);
    // }
    const Eertree<27, '`'> pam(S);
    const SuffixArray sa(S, true);
    
    // using Entry = pair<pair<int, int>, pair<int, int>>;
    using Entry = pair<int, int>;
    vector<Entry> es;
    // for (int u = 2; u < pam.nodesLen; ++u) {
    for (int u = 3; u < pam.n + 3; ++u) if (pam.us[u] == u) {
      // const int l = pam.nodes[u].pos - 1;
      // const int r = l + pam.nodes[u].len;
      const int pos = u - 2 - pam.len[u];
      const int len = pam.len[u];
      const int i = upper_bound(pt.begin(), pt.end(), pos) - pt.begin() - 1;
      if (pt[i] <= pos && pos + len <= pt[i + 1] - 1) {
        int per = len - pam.len[pam.fail[u]];
        if (len % per != 0) {
          per = len;
        }
// cerr<<S.substr(l,r-l)<<" "<<S.substr(ll,rr-ll)<<endl;
// cerr<<S.substr(pos,len)<<" "<<S.substr(pos,per)<<" "<<pos<<" "<<per<<endl;
        es.emplace_back(pos, per);
      }
    }
    const int esLen = es.size();
    
    auto cmp = [&](const pair<int, int> &e0, const pair<int, int> &e1) -> int {
      const int pos0 = e0.first, len0 = e0.second;
      const int pos1 = e1.first, len1 = e1.second;
      const int res = sa.lcp(pos0, pos1);
      if (res < len0 && res < len1) {
        if (S[pos0 + res] < S[pos1 + res]) return -1;
        if (S[pos0 + res] > S[pos1 + res]) return +1;
      }
      if (len0 < len1) return -1;
      if (len0 > len1) return +1;
      return 0;
    };
    sort(es.begin(), es.end(), [&](const Entry &e0, const Entry &e1) -> bool {
      return (cmp(e0, e1) < 0);
    });
    
    Int ans = 0;
    for (int i = 0, j; i < esLen; i = j) {
      for (j = i + 1; j < esLen && cmp(es[i], es[j]) == 0; ++j) {}
      const Int m = j - i;
      ans += m * m;
    }
    printf("%lld\n", ans);
  }
  return 0;
}