#include <bits/stdc++.h>
#define lowbit(x) (x&-x)
using namespace std;
const unsigned long long P = 37, N = (1 << 21);
unsigned long long power[N], Hash[N];
int len, Count[29], pre[N], suf[N];
char ch[N];

struct BIT {
  int tree[P];
  void init() {
    for (int i = 1; i < P; ++i) tree[i] = 0;
  }

  void upt(int id, int val) {
    while (id < P) tree[id] += val, id += lowbit(id);
  }

  int sum(int id) {
    int res = 0;
    while (id > 0) res += tree[id], id -= lowbit(id);
    return res;
  }
} tr;//check point: 树状数组的下标绝对不能为0！！！

void initHash() {
  for (int i = 1; i < len + 1; ++i) {
    Hash[i] = Hash[i - 1] * P + (ch[i] - 'a');
  }
}

inline unsigned long long H(int l, int r) {
  return Hash[r] - Hash[l - 1] * power[r - l + 1];
}

void solve() {
  long long res = 0;
  scanf("%s", ch + 1);
  len = strlen(ch + 1);
  initHash(); tr.init();
  memset(Count, 0, sizeof(Count));
  memset(pre, 0, sizeof(pre));
  memset(suf, 0, sizeof(suf));

  int cc = 0;
  for (int i = 1; i < len + 1; ++i) {
    Count[ch[i] - 'a']++;
    if (Count[ch[i] - 'a'] % 2 == 0) {
      cc--;
    } else {
      cc++;
    }

    pre[i] = cc;
  }
  
  cc = 0; memset(Count, 0, sizeof(Count));
  for (int i = len; i > 0; --i) {
    Count[ch[i] - 'a']++;
    if (Count[ch[i] - 'a'] % 2 == 0) {
      cc--;
    } else {
      cc++;
    }

    suf[i] = cc;
  }
  
  for (int i = 1; i < len + 1; ++i) {
    for (int m = 1; m <= len / i; ++m) {
      int l = (m - 1) * i + 1, r = m * i;
      if (H(l, r) != H(1, i) || r >= len) {
        break;
      }

      res += tr.sum(suf[r + 1] + 1);
    }
    
    tr.upt(pre[i] + 1, 1);
  }

  printf("%lld\n", res);
}

signed main() {
	//freopen("T2.in", "r", stdin);
  int T; scanf("%d", &T); power[0] = 1;
  for (int i = 1; i < N; ++i) power[i] = power[i - 1] * P;

  while (T--) solve();

  return 0;
}