#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i ++ )
#define rop(i, a, b) for (int i = (a); i < (b); i ++ )
#define dep(i, a, b) for (int i = (a); i >= (b); i -- )
#define dop(i, a, b) for (int i = (a); i > (b); i -- )

#define Darr(a, L, R) (cerr << #a "[" << L << " ~ " << R << "] = "; rep(x, L, R) cerr << a[x] << " "; cerr << '\n';)
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define D(x) (cerr << #x << " = " << x << '\n')
#define vit vector<int>::iterator
#define all(x) x.begin(), x.end()
#define min(a, b) (a < b ? a : b)
#define max(a, b) (a > b ? a : b)
#define chkmin(a, b) (a = min(a, b))
#define chkmax(a, b) (a = max(a, b))
#define sit set<int>::iterator
#define lowbit(x) (x & -x)
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pi acos(-1)
#define gc getchar
#define pc putchar
#define db double
#define y second
#define x first

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<db, db> PDD;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const int mod = 998244353;
const int eps = 1e-9;

const int N = (1ll << 21); int T = 1;
void print(int x) { dep(i, 20, 0) pc(((x >> i) & 1) ? '1' : '0'); }
int qpow(int a, int b = mod - 2, int s = 1) { for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) s = 1ll * s * a % mod; return s; }
namespace IO {
	void read() { return; }
	void write(char ch) { pc(ch); return; }
	void write() { return; }
	template <typename T> void read(T &x) { x = 0; T w = 0; char ch = gc(); while (ch < '0' || ch > '9') w |= (ch == '-'), ch = gc(); while ('0' <= ch && ch <= '9') x = x * 10 + (ch ^ 48), ch = gc(); x = w ? -x : x; }
	template <typename T> void print(T x) { if (!x) return; print<T>(x / 10), pc((x % 10) ^ '0'); }
	template <typename T> void write(T x) { if (x > 0) print<T>(x); else if (x < 0) pc('-'), print<T>(-x); else pc('0'); }
	template <typename T> void write(T x, char en) { write<T>(x), pc(en); }
	template <typename T, typename ...T2> void read(T &s, T2 &...oth) { read(s); read(oth...); return; }
}; using namespace IO;

const ULL P = 1331;
int g[N], c[300];
int n, tr[N]; char s[N];
ULL h[N], p[N];
bitset<50> pf[N], sf[N];
ULL Hash(int l, int r) { return h[r] - h[l - 1] * p[r - l + 1]; }
void ins(int x) { for (int i = x; i; i -= (i & -i)) tr[i] ++ ; }
int ask(int x, int S = 0) { for (int i = x; i <= 50; i += (i & -i)) S += tr[i]; return S; }
void sub() {
	int ans = 0;
	vector<int> vec;
	scanf("%s", s + 1);
	n = strlen(s + 1);
	rep(i, 0, n + 1) { pf[i] = sf[i] = 0, g[i] = h[i] = p[i] = tr[i] = 0; }
	// Get prefix-F
	memset(c, 0, sizeof c);
	rep(i, 1, n) {
		pf[i] = pf[i - 1]; pf[i].flip(s[i] - 'a');
	}
	// Get suffix-F
	memset(c, 0, sizeof c); sf[n + 1] = 0;
	dep(i, n, 1) {
		sf[i] = sf[i + 1]; sf[i].flip(s[i] - 'a');
	}
	// Get Hash
	rep(i, 1, n) h[i] = h[i - 1] * P + 1ull * s[i];
	p[0] = 1ull; rep(i, 1, n) p[i] = p[i - 1] * P;
	// Get g
	rep(k, 1, n) for (int i = 1; i + k - 1 <= n; i += k)
		if (Hash(1, k) == Hash(i, i + k - 1)) g[k] ++ ;
		else break;
	rep(k, 1, n) if (g[k] * k == n) g[k] -- ;
	rep(k, 2, n - 1) {
		ins(pf[k - 1].count());
		// Even : (g[k] + 1) / 2
		int q = sf[g[k] * k + 1].count();
		int S = g[k] * (k - 1);
		S -= ask(q + 1) * ((g[k] + 1) / 2);
		q = (sf[g[k] * k + 1] ^ pf[k]).count();
		S -= ask(q + 1) * (g[k] / 2); ans += S;
//		D(k); D(S);
	} printf("%lld\n", ans);
}
signed main() {
	read(T);
	while (T -- ) sub();
	return 0;
}