#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
using namespace std;
ll read(){
	ll X = 0,r = 1;
	char ch = getchar();
	while(!isdigit(ch) && ch != '-') ch = getchar();
	if(ch == '-') r = -1,ch = getchar();
	while(isdigit(ch)) X = X*10+ch-'0',ch = getchar();
	return X*r;
}
const int N = (1<<20)+10;
int n;
char s[N];
ull hsh[N],pw[N],P=1331;
inline ull gethsh(int l,int r){
	return hsh[r]-hsh[l-1]*pw[r-l+1];
}
ll suf[N],pre[N],sum[N][30];
int t[30];
void solve(){
	scanf("%s",s+1);
	n = strlen(s+1);
	pw[0] = 1;
	for(int i=1;i<=n;i++){
		pw[i] = pw[i-1]*P;
		hsh[i] = hsh[i-1]*P+s[i];
	}
	int now = 0;
	for(int i=0;i<26;i++) t[i] = 0;
	for(int i=n;i;i--){
		int c = s[i]-'a';
		now -= t[c]&1;
		t[c]++;
		now += t[c]&1;
		suf[i] = now;
	}
	now = 0;
	for(int i=0;i<26;i++) t[i] = 0;
	for(int i=1;i<=n;i++){
		int c = s[i]-'a';
		now -= t[c]&1;
		t[c]++;
		now += t[c]&1;
		pre[i] = now;
	}
	for(int i=1;i<=n;i++){
		for(int j=0;j<=26;j++) sum[i][j] = sum[i-1][j];
		sum[i][pre[i]]++;
	}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=26;j++) sum[i][j] += sum[i][j-1];
	ll ans = 0;
	for(int i=2;i<=n;i++){
		int lst = 1;
		for(int j=i;j<n;j+=i){
			if(hsh[i] != gethsh(lst,j)) break;
			lst = j+1;
			ans += sum[i-1][suf[j+1]];
		}
	}
	cout << ans << "\n";
}
int main(){
//	freopen("string.in","r",stdin);
//	freopen("string.out","w",stdout);
	int T = read();
	while(T--) solve();
	return 0;
}