#include <bits/stdc++.h>
using namespace std;
const int N = 1048580;

int n, nxt[N];
int pre[N], suf[N], cnt[26], tmp[27]; // tmp[i] 记录 A 中出现 0~i 个奇数字符的方案数
// pre[i] 记录 s[1...i] 中出现奇数字符的个数
char s[N];

void solve(void) {
    scanf("%s", s + 1); n = strlen(s + 1); suf[n + 1] = 0; 
    for (int i = 2, p = 0; i <= n; ++i) {
        while (p && s[i] != s[p + 1]) p = nxt[p];
        if (s[i] == s[p + 1]) ++p; nxt[i] = p; 
    } memset(cnt, 0, sizeof cnt);
    for (int i = n; i >= 1; --i) {
        ++cnt[s[i] - 'a'];
        if (cnt[s[i] - 'a'] & 1) suf[i] = suf[i + 1] + 1; 
        else suf[i] = suf[i + 1] - 1; 
    } memset(cnt, 0, sizeof cnt);
    for (int i = 1; i <= n; ++i) {
        ++cnt[s[i] - 'a'];
        if (cnt[s[i] - 'a'] & 1) pre[i] = pre[i - 1] + 1; 
        else pre[i] = pre[i - 1] - 1; 
    } long long ans = 0; memset(tmp, 0, sizeof tmp);
    for (int i = 1; i < n; ++i) { // |AB| 的长度
        if (i >= 2) {
            ans += tmp[suf[i + 1]];
            for (int j = i + i; j < n && i % (j - nxt[j]) == 0; j += i)
                ans += tmp[suf[j + 1]]; 
        }
        for (int j = pre[i]; j <= 26; ++j) ++tmp[j];
    }
    printf("%lld\n", ans);
}

int main(void) {
    int T; scanf("%d", &T); while (T--) solve();
    return 0;
}