#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;

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 int N = (1ll << 20) + 5;
const ULL BASE = 1331ull;
bool isj[30], disj[30];
int t, len, jcnt, djcnt[N], bit[30]; 
ULL h[N], ans; 
char s[N];

void update(int x) {
	++ x;
	while (x <= 27) { ++ bit[x]; x += lowbit(x); } 
}
int sum(int x, int s = 0) {
	++ x;
	while (x >= 1) {
		s += bit[x];
		x -= lowbit(x);
	} return s;
}
int input(char* s) {
	char c = getchar();
	int i = 0;
	while(!islower(c))
		c = getchar();
	while(islower(c)) {
		s[ ++ i] = c;
		c = getchar();
	} return i;
}
void sub() {
	len = input(s);
	djcnt[len] = 1; 
	disj[s[len] - 'a'] = 1;
	dep(i, len - 1, 1)
		djcnt[i] = djcnt[i + 1] + ((disj[s[i] - 'a'] = !disj[s[i] - 'a']) == 1 ? 1 : -1);
	h[1] = s[1] - 'a'; 
	rep(i, 2, len) h[i] = h[i - 1] * BASE + s[i] - 'a';
	ULL a = BASE*BASE;
	update(1); 
	isj[s[1] - 'a'] = 1; 
	jcnt = 1;
	rep(i, 2, len) { int x = 1; 
		for (int j = (i << 1); j <= len; j += i) {
			if (h[j] - h[j - i]*a == h[i]) x ++ ;
			else break;
		}
		if(x * i == len) ans += 1ull * bit[1] * ((x - 1) >> 1); 
		else ans += 1ull * sum(djcnt[x * i + 1]) * ((x + 1) >> 1); 
		ans += 1ULL*sum(djcnt[(x - 1) * i + 1]) * (x >> 1); 
		update((isj[s[i] - 'a'] = !isj[s[i] - 'a']) ? ++ jcnt : -- jcnt); 
		a *= BASE;
	} printf("%llu\n", ans);
	memset(disj, 0, sizeof disj);
	memset(isj, 0, sizeof isj);
	memset(bit, 0, sizeof bit);
	ans = 0;
}
signed main() {
	read(T); while (T -- ) sub(); 
	return 0;
}