#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1048580;
int n;
char S[maxn];
ll msk[maxn], sum[maxn];
struct hsh {
    ll rad, mod, arr[maxn], pw[maxn];
    hsh(ll x, ll y) {
        rad = x;
        mod = y;
    }
    void init(char* s) {
        arr[0] = 0;
        int n = strlen(s + 1);
        for (int i = 1; i <= n; i++) {
            arr[i] = (arr[i - 1] * rad % mod + (s[i] - 'a')) % mod;
        }
        pw[0] = 1;
        for (int i = 1; i <= n; i++) {
            pw[i] = pw[i - 1] * rad % mod;
        }
    }
    ll getseg(int l, int r) {
        return (arr[r] + mod - arr[l - 1] * pw[r - l + 1] % mod) % mod;
    }
};
void solve() {
    scanf("%s", S + 1);
    n = strlen(S + 1);
    hsh h(31, 998244353);
    h.init(S);
    for (int i = 1; i <= n; i++) {
        msk[i] = msk[i - 1] ^ (1 << (S[i] - 'a'));
    }
    for (int i = 0; i <= 26; i++) {
        sum[i] = 0;
    }
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = i; j < n; j += i) {
            if (h.getseg(j - i + 1, j) != h.getseg(1, i)) {
                break;
            }
            ans += sum[__builtin_popcount(msk[n] ^ msk[j])];
        }
        for (int j = __builtin_popcount(msk[i]); j <= 26; j++) {
            sum[j]++;
        }
    }
    printf("%lld\n", ans);
}
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}