#include<bits/stdc++.h>
#define LL long long

using namespace std;

const int mod = 998244353;
const int maxn = 1010;

const int B = 28;

int h[maxn];
int hr[maxn];

int p[maxn];

int n;

int calh(int l, int r) {
	return (h[r] - (h[l-1] * p[r - l + 1] % mod) + mod ) % mod;
}

int calhr(int l, int r) {
	return (hr[l] - (hr[r+1] * p[r - l + 1] % mod) + mod ) % mod;
}

bool check(int l, int r) {
	return calh(l, r) == calhr(l, r);
}

void init() {
	p[0] = 1;
	for (int i = 1; i < maxn; i++) p[i] = (LL)p[i-1] * B % mod;
}

void cal(string s) {
	n = s.size();
	s = ' ' + s;
	for (int i = 1; i <= n; i++) {
		h[i] = ((LL)h[i-1] * B + s[i] - 'a' + 1) % mod;
	}
	
	for (int i = n; i >= 1; i--) {
		hr[i] = ((LL)hr[i+1] * B + s[i] - 'a' + 1) % mod;
	}
	LL res = 0;
	for (int l = 1; l <= n; l++) {
		for (int m = l; m <= n; m++) {
			for (int r = m+1; r <= n; r++) {
				if (check(l, m) && check(m+1, r)) {
					res = (res + (LL)l * r % mod) % mod;
				}
			}
		}
	}
	cout << res << endl;
}

int main() {
	init();
	int T;
	cin >> T;
	while (T--) {
		string s;
		cin >> s;
		cal(s);
	}
}