#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
ll mod[2], P[2];
int const maxn = 1e6 + 5;
ll p[2][maxn], rev[2][maxn], h[2][maxn];
vector < pair < int, int > > palindromes;
int len[maxn];
set < pair < ll, ll > > used[maxn];
vector < pair < ll, ll > > open[maxn];

ll st(ll x, ll y, ll m) {
    if (y == 0) return 1;
    if (y % 2 == 0) return st(x * x % m, y / 2, m);
    return x * st(x, y - 1, m) % m;
}

inline pair < ll, ll > get(int l, int r) {
    return {(h[0][r] - h[0][l - 1] + mod[0]) * rev[0][l - 1] % mod[0], (h[1][r] - h[1][l - 1] + mod[1]) * rev[1][l - 1] % mod[1]};
}

void manaker_odd(string s) {
    int l = 0, r = 0, n = s.size();
    for (int i = 1; i < n; i++) {
        if (i <= r) len[i] = min(r - i + 1, len[l + r - i]);
        else len[i] = 0;
        while (i - len[i] > 0 && i + len[i] < n && s[i - len[i]] == s[i + len[i]]) {
            palindromes.push_back({i - len[i], i + len[i]});
            len[i]++;
        }
        if (i + len[i] - 1 > r) {
            r = i + len[i] - 1;
            l = i - len[i] + 1;
        }
    }
}

void manaker_even(string s) {
    int l = 0, r = 0, n = s.size();
    for (int i = 2; i < n; i++) {
        if (i <= r) len[i] = min(r - i + 1, len[l + r - i + 1]);
        else len[i] = 0;
        while (i - len[i] - 1 > 0 && i + len[i] < n && s[i - len[i] - 1] == s[i + len[i]]) {
            palindromes.push_back({i - len[i] - 1, i + len[i]});
            len[i]++;
        }
        if (i + len[i] - 1 > r) {
            r = i + len[i] - 1;
            l = i - len[i];
        }
    }
}

main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
#endif // HOME
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    P[0] = 29, P[1] = 31, mod[0] = 1e9 + 9, mod[1] = 1e9 + 7;
    for (int j = 0; j <= 1; j++) {
        p[j][0] = 1, rev[j][0] = 1;
        for (int i = 1; i < maxn; i++) p[j][i] = p[j][i - 1] * P[j] % mod[j];
        rev[j][maxn - 1] = st(p[j][maxn - 1], mod[j] - 2, mod[j]);
        for (int i = maxn - 2; i >= 1; i--) rev[j][i] = rev[j][i + 1] * P[j] % mod[j];
    }
    for (int i = 1; i <= n; i++) {
        string s;
        cin >> s;
        int len = s.size();
        s = "#" + s;
        for (int t = 0; t <= 1; t++) {
            for (int j = 1; j <= len; j++) {
                h[t][j] = (h[t][j - 1] + (s[j] - 'a' + 1) * p[t][j - 1]) % mod[t];
            }
        }
        palindromes = {};
        manaker_even(s);
        manaker_odd(s);
        for (auto key : palindromes) used[key.second - key.first + 1].insert(get(key.first, key.second));
    }
    for (int i = 1; i < maxn; i++) {
        for (auto key : used[i]) {
            open[i].push_back(key);
        }
    }
    set < pair < ll, ll > > bad;
    __int128 ans = 0;
    for (int len = 1; len < maxn; len++) {
        for (auto key : open[len]) {
            if (bad.find(key) != bad.end()) continue;
            int cur_len = 0;
            ll cur_h1 = 0;
            ll cur_h2 = 0;
            while (1) {
                cur_h1 = (cur_h1 * p[0][len] + key.first) % mod[0];
                cur_h2 = (cur_h2 * p[1][len] + key.second) % mod[1];
                if (used[cur_len + len].find({cur_h1, cur_h2}) == used[cur_len + len].end()) break;
                cur_len += len;
                bad.insert({cur_h1, cur_h2});
            }
            ll cnt = cur_len / len;
            ans += cnt * cnt;
        }
    }
    string out = "";
    while (ans) {
        out += char('0' + ans % 10);
        ans /= 10;
    }
    if (out.empty()) out = "0";
    else reverse(out.begin(), out.end());
    cout << out << '\n';
    return 0;
}