#include <bits/stdc++.h>

#define fi first
#define se second
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(a,b) memset(a,b,sizeof(a))
#define FOR(i,a,b) for(int i = (a);i <= (b);++i)
#define ROF(i,a,b) for(int i = (a);i >= (b);--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = (1<<20)+114514;

char str[MAXN];
int nxt[MAXN],n;
int f[MAXN],g[MAXN],cnt[26],now;
int sm[27];

inline void add(int x,int y){
	if(cnt[x]&1) --now;
	cnt[x] += y;
	if(cnt[x]&1) ++now;
}

inline void Solve(){
	scanf("%s",str+1);n = strlen(str+1);
	nxt[1] = 0;int j = 0;
	FOR(i,2,n){
		while(j && str[j+1] != str[i]) j = nxt[j];
		if(str[j+1] == str[i]) ++j;
		nxt[i] = j;
	}
	CLR(cnt,0);now = 0;
	FOR(i,1,n) add(str[i]-'a',1),f[i] = now;
	CLR(cnt,0);now = 0;
	ROF(i,n,1) add(str[i]-'a',1),g[i] = now;
	int p = 0;CLR(sm,0);
	LL ans = 0;
	FOR(i,2,n-1){// length of AB
		while(p+1 <= i-1){
			++p;
			FOR(j,f[p],26) ++sm[j];
		}
		for(int j = i;j < n;j += i){
			int zq = j-nxt[j];
			if(j%zq) zq = j;
			if(i%zq) break;
			ans += sm[g[j+1]];
		}
	}
	printf("%lld\n",ans);
}

int main(){
	
	int T;scanf("%d",&T);//T = 1;
	while(T--) Solve();
	return 0;
}