#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long long ll;
typedef long double ld;

const int MOD1 = (int) 1e9 + 9;
const int MOD2 = 998244353;
const int P1 = 73;
const int P2 = 89;
const int MAXLEN = 1000000;

int hashs1[MAXLEN + 5], step1[MAXLEN + 5];
int hashs2[MAXLEN + 5], step2[MAXLEN + 5];

int man_even[MAXLEN + 5], man_odd[MAXLEN + 5];
int open[MAXLEN + 5], period[MAXLEN + 5];

vector <int> spis[MAXLEN + 5];
map <pair <int, int>, int> max_occur;

pair <int, int> get_hash(int lef, int rig)
{
	int hs1 = (hashs1[rig] - (ll) hashs1[lef - 1] * step1[rig - lef + 1] % MOD1 + MOD1) % MOD1;
	int hs2 = (hashs2[rig] - (ll) hashs2[lef - 1] * step2[rig - lef + 1] % MOD2 + MOD2) % MOD2;
	return mp(hs1, hs2); 	
}

int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
 	ios_base::sync_with_stdio(0); cin.tie(0);

 	int test;
 	cin >> test;

 	step1[0] = step2[0] = 1;
 	for (int i = 1; i <= MAXLEN; i++)
 	{
 		step1[i] = (ll) step1[i - 1] * P1 % MOD1;
 		step2[i] = (ll) step2[i - 1] * P2 % MOD2;
 	}

 	for (int rep = 1; rep <= test; rep++)
 	{
 	 	string s;
 	 	cin >> s;

 	 	int n = (int) s.length();

 	 	for (int i = 1; i <= n; i++)
 	 	{
 	 		hashs1[i] = ((ll) hashs1[i - 1] * P1 + s[i - 1] - 'a' + 1) % MOD1;
 	 		hashs2[i] = ((ll) hashs2[i - 1] * P2 + s[i - 1] - 'a' + 1) % MOD2;
 	 	}

 	 	for (int i = 1; i <= n; i++) open[i] = 0;

 	 	{
 	 	 	int lef = 0, rig = 0;
 	 	 	for (int i = 1; i < n; i++)
 	 	 	{
 	 	 	 	int len = 0;
 	 	 	 	if (rig > i) len = min(rig - i, man_even[lef + rig - i - 1]);
 	 	 	 	while (i - len - 1 >= 0 && i + len < n && s[i - len - 1] == s[i + len]) len++;
 	 	 	 	man_even[i] = len;
 	 	 	 	if (i + len > rig) rig = i + len, lef = i - len + 1;
 	 	 	}

 	 	 	for (int i = 1; i < n; i++)
 	 	 		if (man_even[i] != 0) open[i - man_even[i] + 1] = max(open[i - man_even[i] + 1], i + man_even[i]);
 	 	}

 	 	{
 	 	    int lef = 0, rig = 0;
 	 	 	for (int i = 1; i <= n; i++)
 	 	 	{
 	 	 	 	int len = 0;
 	 	 	 	if (rig > i) len = min(rig - i, man_odd[lef + rig - i]);
 	 	 	 	while (i - len - 2 >= 0 && i + len < n && s[i - len - 2] == s[i + len]) len++;
 	 	 	 	man_odd[i] = len;
 	 	 	 	if (i + len > rig) rig = i + len, lef = i - len;
 	 	 	}

 	 	 	for (int i = 1; i <= n; i++)
 	 	 		open[i - man_odd[i]] = max(open[i - man_odd[i]], i + man_odd[i]);
 	 	}

 	 	for (int i = 1; i <= n; i++)
 	 		open[i] = max(open[i], open[i - 1] - 1);

 	 	for (int i = 1; i <= n; i++) spis[i].clear(), period[i] = 0;
 	 	for (int i = 1; i <= n; i++)
 	 		spis[open[i] - i + 1].pb(i);

 	 	for (int del = 1; del <= n; del++)
 	 		for (int kr = del; kr <= n; kr += del)
 	 			for (int num : spis[kr])
 	 			{
 	 				if (period[num] != 0) continue;

 	 			  	if (get_hash(num, num + kr - 1 - del) == get_hash(num + del, num + kr - 1)) period[num] = del;
 	 			}
 	 	for (int i = 1; i <= n; i++)
 	 	{
 	 		pair <int, int> hs = get_hash(i, i + period[i] - 1);
 	 		int mx = max(max_occur[hs], (open[i] - i + 1) / period[i]);
 	 		max_occur[hs] = mx;
 	 	}
 	}         

 	ll ans = 0;
 	for (const auto &[str, kol] : max_occur) ans += (ll) kol * kol;
 	cout << ans << '\n';
 	return 0;
}