// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T &x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T &x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 5010;
int n, lcs[N][N], f[N][N], g[N][N];
void zhk() {
	string st; cin >> st;
	n = st.size(); st = ' ' + st;
	F(i, 1, n)
		F(j, 1, n)
			g[i][j] = f[i][j] = 0;
	F(i, 1, n)
		F(j, i + 1, n)
			lcs[i][j] = st[i] == st[j] ? lcs[i - 1][j - 1] + 1 : 0;
	F(i, 2, n)
		F(j, i + 1, n) {
			int t = min(j - i, lcs[i - 1][j]);
			f[i - 1][i - 1 - t + 1]++;
		}
	F(i, 1, n)
		for (int j = i + 1; j <= n; j += 2) {
			int len = (j - i + 1) / 2;
			if (lcs[i + len - 1][j] >= len) g[i + len][j] = 1;
		}
	F(i, 1, n)
		F(j, 1, n)
			g[i][j] += g[i][j - 1];
	ll s = 0;
	F(i, 1, n)
		F(j, 1, i - 1)
			s += (ll) (f[i][j] += f[i][j - 1]) * g[j][i - 1];
	cout << s << '\n';
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/