// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<iiii> viiii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005;
const int MAXN = 1000005;
const pll MOD = {998244353, 1000000007};
const pll X = {31, 31};

namespace eertree {
    const int MAXC = 26;
    struct node {
        int nxt[MAXC];
        int len, link, period;
        node() {
            memset(nxt, 0, sizeof nxt);
            len = link = period = 0;
        }
    };
    vector<node> nodes;
    string _s;
    int head;

    void init() {
        _s = "";
        nodes.clear();
        node nw = node();
        nw.len = -1; nw.link = -1;
        nodes.pb(nw);
        nw = node();
        nw.len = 0; nw.link = 0;
        nodes.pb(nw);
        head = 1;
    }

    bool insert(char c) {
        _s += c;
        while (SZ(_s) - nodes[head].len - 2 < 0 || _s[SZ(_s) - nodes[head].len - 2] != c) {
            head = nodes[head].link;
        }
        if (nodes[head].nxt[c - 'a']) {
            head = nodes[head].nxt[c - 'a'];
            return 0;
        }
        nodes[head].nxt[c - 'a'] = SZ(nodes);
        node nw = node();
        nw.len = nodes[head].len + 2;
        if (nw.len == 1) {
            nw.link = 1;
            nw.period = 1;
        } else {
            int nl = nodes[head].link;
            while (SZ(_s) - nodes[nl].len - 2 < 0 || _s[SZ(_s) - nodes[nl].len - 2] != c) {
                nl = nodes[nl].link;
            }
            assert(nodes[nl].nxt[c - 'a'] != 0);
            nw.link = nodes[nl].nxt[c - 'a'];
            nw.period = nw.len;
            int ot = nodes[nl].nxt[c - 'a'];
            if (ot != 0 && nodes[ot].period == nw.len - nodes[ot].len) {
                nw.period = nodes[ot].period;
            }
        }
        head = SZ(nodes);
        nodes.pb(nw);
        return 1;
    }
}
using namespace eertree;

int n;
string s[MAXN];
pll hsh[MAXN];
map<pll, int> mp;
ll ans;

pll operator+ (const pll &l, const pll &r) {
    pll res = {l.FI + r.FI, l.SE + r.SE};
    if (res.FI >= MOD.FI) {
        res.FI -= MOD.FI;
    }
    if (res.SE >= MOD.SE) {
        res.SE -= MOD.SE;
    }
    return res;
}
pll operator- (const pll &l, const pll &r) {
    pll res = {l.FI - r.FI, l.SE - r.SE};
    if (res.FI < 0) {
        res.FI += MOD.FI;
    }
    if (res.SE < 0) {
        res.SE += MOD.SE;
    }
    return res;
}
pll operator* (const pll &l, const pll &r) {
    return {l.FI * r.FI % MOD.FI, l.SE * r.SE % MOD.SE};
}
pll fpow(pll b, int p) {
    pll res = {1, 1};
    while (p) {
        if (p & 1) {
            res = res * b;
        }
        b = b * b;
        p >>= 1;
    }
    return res;
}
pll fpow(pll b, pll p) {
    return {fpow(b, p.FI).FI, fpow(b, p.SE).SE};
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n;
    REP (i, 0, n) {
        cin >> s[i];
    }
    REP (i, 0, n) {
        eertree::init();
        s[i] = "?" + s[i];
        REP (j, 1, SZ(s[i])) {
            hsh[j] = hsh[j - 1] + fpow(X, j) * pll(s[i][j] - 'a', s[i][j] - 'a');
            if (eertree::insert(s[i][j])) {
                int l = j - nodes[head].period;
                pll chsh = (hsh[j] - hsh[l]) * fpow(fpow(X, l), MOD - pll(2, 2));
                mxto(mp[chsh], nodes[head].len / nodes[head].period);
            }
        }
    }
    for (auto [h, x] : mp) {
        ans += (ll) x * x;
    }
    cout << ans << '\n';
    return 0;
}