#include <bits/stdc++.h>

typedef long long LL;
const int N = (1 << 17) + 5;
const int hmod = 1004535809, hbase = 233;

char s[N];
bool cnt[26];
int n, pre[27][N], min[N];
int hash[N], p[N], rtime[N];
int d[N], sd[N], ds[N * 20];

int get_hash(int l, int r) {
	return (hash[r] + (LL) (hmod - p[r - l + 1]) * hash[l - 1]) % hmod;
}

void solve() {
	std::cin >> s + 1, n = std::strlen(s + 1);
	for (int i = 0; i < 26; ++i) cnt[i] = 0;
	hash[0] = 0;
	for (int i = 1; i <= n; ++i)
		hash[i] = ((LL) hash[i - 1] * hbase + s[i]) % hmod;
	int now = 0;
	for (int i = 1; i <= n; ++i) {
		now += cnt[s[i] - 'a'] ? -1 : 1;
		cnt[s[i] - 'a'] ^= 1;
		for (int j = 0; j <= 26; ++j)
			pre[j][i] = pre[j][i - 1] + (now <= j);
	}
	for (int i = 1; i <= n; ++i) min[i] = i, rtime[i] = 1;
	for (int i = 1; i <= n; ++i) if (min[i] == i) {
		for (int j = 2, t = i * 2; t <= n; t += i, ++j) {
			if (get_hash(t - i + 1, t) != hash[i])
				break;
			min[t] = i, rtime[t] = j;
		}
	}
	long long ans = 0;
	now = 0;
	for (int i = 0; i < 26; ++i) cnt[i] = 0;
	for (int i = n; i > 1; --i) {
		now += cnt[s[i] - 'a'] ? -1 : 1;
		cnt[s[i] - 'a'] ^= 1;
		int a = min[i - 1], B = rtime[i - 1];
		for (int j = 0; j < d[B]; ++j) {
			ans += pre[now][ds[sd[B] + j] * a - 1];
		}
	}
	std::cout << ans << '\n';
}
int main() { 
	std::ios::sync_with_stdio(0), std::cin.tie(0);
	p[0] = 1;
	for (int i = 1; i < N; ++i) p[i] = (LL) p[i - 1] * hbase % hmod;
	for (int i = 1; i < N; ++i)
		for (int j = i; j < N; j += i) ++d[j];
	for (int j = 1; j < N; ++j) sd[j] = sd[j - 1] + d[j - 1];
	for (int j = 1; j < N; ++j) d[j] = 0;
	for (int i = 1; i < N; ++i)
		for (int j = i; j < N; j += i) ds[sd[j] + (d[j]++)] = i;
	int tc; std::cin >> tc; while (tc--) solve();
	return 0;
}