#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<string>
#include<iomanip>
#include<algorithm>
#include<map>
using namespace std;
#define LL long long
#define FILE "dealing"
#define up(i,j,n) for(int i=j;i<=n;++i)
#define db double
#define uint unsigned int
#define eps 1e-12
#define pii pair<int,int>
int read(){
	int x=0,f=1,ch=getchar();
	while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
	while(ch>=‘0‘&&ch<=‘9‘){x=(x<<1)+(x<<3)+ch-‘0‘;ch=getchar();}
	return f*x;
}
const int maxn=1000010,maxm=20000,limit=1e6,mod=(int)(7+1e9+0.1);
const db inf=(1e18);
template<class T>bool cmax(T& a,T b){return a<b?a=b,true:false;}
template<class T>bool cmin(T& a,T b){return a>b?a=b,true:false;}
template<class T>T min(T& a,T& b){return a<b?a:b;}
template<class T>T max(T& a,T& b){return a>b?a:b;}
char s[maxn];
int n,next[maxn];
int num[maxn],t[maxn];
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	int T=read();
	while(T--){
		scanf("%s",s+1);
		n=strlen(s+1);
		LL ans=1,j=0;
		t[1]=1;
		up(i,2,n){
			while(j&&s[j+1]!=s[i])j=next[j];
			if(s[j+1]==s[i])j++;
			next[i]=j;
			t[i]=t[j]+1;
		}
		j=1;
		up(i,2,n){
			while(j&&s[j+1]!=s[i])j=next[j];
			if(s[j+1]==s[i])j++;
			while((j<<1)>i)j=next[j];
			ans=ans*(t[j]+1)%mod;
		}
		printf("%lld\n",ans);
	}
	return 0;
}