#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t lll;
typedef double db;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define fir first
#define sec second
typedef vector <int> vi;
typedef vector <ll> vl;

#ifdef LCX
#define msg(args...) fprintf(stderr, args)
#else
#define msg(...) void()
#endif

ll sqr(int n) { return (ll) n * n; }
const int maxn = 1e6 + 10, C = 26;
int n;

int nxt[maxn][C], fail[maxn], len[maxn], tot;
map <int, int> s[maxn];

void merge(int u, int v) {
    if (s[u].size() < s[v].size()) swap(s[u], s[v]);
    for (pii p : s[v]) s[u][p.fir] += p.sec;
    s[v] = map <int, int> ();
}

int main() {
    scanf("%d", &n);
    len[0] = 0, fail[0] = 1;
    len[1] = -1, fail[1] = 0;
    tot = 1;
    for (int i = 1; i <= n; ++i) {
        static char str[maxn];
        scanf("%s", str + 1);
        int l = strlen(str + 1);
        int p = 0;
        for (int j = 1; j <= l; ++j) {
            while (str[j - len[p] - 1] != str[j]) p = fail[p];
            int c = str[j] - 'a';
            if (!nxt[p][c]) {
                int v = ++tot; int q = fail[p];
                while (str[j - len[q] - 1] != str[j]) q = fail[q];
                fail[v] = nxt[q][c], len[v] = len[p] + 2;
                nxt[p][c] = v;
            }
            p = nxt[p][c];
            msg("%d fail %d\n", p, fail[p]);
            for (int k = j - len[p] + 1; k <= j; ++k)
                msg("%c", str[k]);
            msg("\n");
        }
    }
    ll ans = 0;
    for (int i = tot; i >= 2; --i) {
        if (len[i] % (len[i] - len[fail[i]]) == 0)
            s[i][len[i] - len[fail[i]]]++;
        else s[i][len[i]]++;
        auto it = s[i].find(len[i]);
        if (it != s[i].end())
            msg("%d: %d\n", i, it->sec),
            ans += sqr(it->sec);
        merge(fail[i], i);
    }
    printf("%lld\n", ans);
    return 0;
}