#include <iostream>
#include <cstdio>
#include <cstring>
#define rint register int
using namespace std;
typedef long long LL;
const int N = 1000005, L = 20, P = 1e9 + 7;
int n, nxt[N], dep[N], fa[N][L];
char s[N];
int inline get(int x) {
	int l = x / 2;
	for (rint i = L - 1; ~i; i--)
		if (fa[x][i] > l) x = fa[x][i];
	return dep[fa[x][0]];
}
int main() {
	int T; scanf("%d", &T);
	while (T--) {
		memset(fa, 0, sizeof fa);
		scanf("%s", s + 1);
		n = strlen(s + 1);
		dep[1] = 1;
		for (rint i = 2, j = 0; i <= n; i++) {
			while (j && s[i] != s[j + 1]) j = nxt[j];
			if (s[i] == s[j + 1]) j++;
			// j -> i
			nxt[i] = j;
			dep[i] = dep[j] + 1, fa[i][0] = j;
			for (rint j = 1; j < L && fa[i][j - 1]; j++) 
				fa[i][j] = fa[fa[i][j - 1]][j - 1];
		}
		int ans = 1;
		for (rint i = 1; i <= n; i++) 
			ans = (LL)ans * (get(i) + 1) % P;
		printf("%d\n", ans);
	}
	return 0;
}