#include<iostream>
using namespace std;
#include<vector>
#include<string>
#include<map>

map<pair<int, int>, int> mp;

const int N = 1e6;
vector<int> prime, minp(N + 1);

const int mod[2] = { (int)1e9 + 463, (int)1e9 + 469 };
const int base[2] = { 133, 331 };
long long power[2][N + 1];

void init() {
	minp[1] = 1;
	for (int i = 2; i <= N; ++i) {
		if (minp[i] == 0) {
			minp[i] = i;
			prime.emplace_back(i);
		}
		for (int v : prime) {
			if (i * v > N) break;
			minp[i * v] = v;
			if (i % v == 0) break;
		}
	}

	for (int i = 0; i < 2; ++i) {
		power[i][0] = 1;
		for (int j = 1; j <= N; ++j) {
			power[i][j] = power[i][j - 1] * base[i] % mod[i];
		}
	}
	return;
}

struct Hash {
	vector<int> hash[2];

	Hash() {}

	Hash(string s) {
		int n = s.size();
		for (int i = 0; i < 2; ++i) {
			hash[i].resize(n + 1);
			hash[i][0] = 0;
			for (int j = 0; j < n; ++j) {
				hash[i][j + 1] = (1LL * hash[i][j] * base[i] % mod[i] + s[j]) % mod[i];
			}
		}
		return;
	}

	pair<int, int> get(int l, int r) {
		pair<int, int> ans;
		ans.first = (mod[0] + hash[0][r] - hash[0][l - 1] * power[0][r - l + 1] % mod[0]) % mod[0];
		ans.second = (mod[1] + hash[1][r] - hash[1][l - 1] * power[1][r - l + 1] % mod[1]) % mod[1];
		return ans;
	}

	int query(int l, int r) {
		int len = r - l + 1;
		int ans = len;
		//cout << l << " " << r << "\n";
		while (len > 1) {
			int Minp = minp[len];
			len /= Minp;
			int t = ans / Minp;
			//cout << ans << " " << t << " " << l << " " << r << "\n";
			if (get(l, r - t) == get(l + t, r)) ans /= Minp;
			//cout << get(l, r - t).first << " " << get(l, r - t).second <<
			//	get(l + t, r).first << " " << get(l + t, r).second << "\n";
		}
		return ans;
	}
};

struct PAM {
	struct Node {
		int nxt[26], len, link;
		Node() : len(0), link(0) {
			for (int i = 0; i < 26; ++i) nxt[i] = 0;
		}
	};
	
	Hash h;
	vector<Node> node;
	int cnt = 0, p = 0, last = 0;
	string s;

	void init() {
		cnt = 1, last = 0, p = 0;
		node[0].len = 0, node[0].link = 1;
		node[1].len = -1, node[1].link = 0;
		for (int i = 0; i < 26; ++i) {
			node[0].nxt[i] = 0;
			node[1].nxt[i] = 0;
		}
		return;
	}

	int getlink(int x) {
		while (s[p - node[x].len - 1] != s[p]) x = node[x].link;
		return x;
	}

	void insert(int c) {
		++p;
		int now = getlink(last);
		if (node[now].nxt[c] == 0) {
			int x = ++cnt;
			node[x].len = node[now].len + 2;
			node[x].link = node[getlink(node[now].link)].nxt[c];
			node[now].nxt[c] = x;
			int d = h.query(p - node[x].len + 1, p);
			//cerr << d << " " << p << "\n";
			int t = p - node[x].len;
			mp[h.get(t + 1, t + d)] = max(mp[h.get(t + 1, t + d)], node[x].len / d);
		}
		last = node[now].nxt[c];
	}

	PAM(string s) {
		node.resize(s.size() + 100);
		init();
		h = Hash(s);
		s = '$' + s;
		this->s = s;
		for (char c : s) {
			if (c == '$') continue;
			insert(c - 'a');
		}
		return;
	}
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	init();

	int n = 0;
	cin >> n;

	for (int i = 0; i < n; ++i) {
		string s;
		cin >> s;
		PAM t(s);
	}

	long long ans = 0;
	for (auto it : mp) {
		ans += 1LL * it.second * it.second;
	}

	cout << ans << "\n";

	return 0;
}