#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=l;i<=r;i++)
using namespace std;
void kmp(string str,int*pre,int*num){
	int len=0;
	num[1]=1;
	fo(i,2,str.size()-1){
		while(len&&str[i]!=str[len+1])len=pre[len];
		pre[i]=(len+=(str[i]==str[len+1])),num[i]=num[len]+1;
	}
}
string s;
int nxt[1000005],num[1000005];
long long ans;
void solve(){
	cin>>s,s=' '+s,kmp(s,nxt,num),ans=1;
	int tmp=0;
	fo(i,2,s.size()-1){
//		int len=pre[i-1];
		while(tmp&&s[i]!=s[tmp+1])tmp=nxt[tmp];
		if(s[i]==s[tmp+1])tmp++;
//		cout<<i<<' '<<nxt[i]<<' '<<num[i]<<' ';
//		int tmp=nxt[i]-1;
		while(tmp>i/2)tmp=nxt[tmp];//cout<<'\n'<<tmp;
		ans=ans*(num[tmp]+1)%1000000007;
//		cout<<tmp<<' '<<num[tmp]+1<<'\n';
	}
	cout<<ans<<'\n';
}
signed main(){/*ios::sync_with_stdio(0);*/int t;cin>>t;while(t--)solve();return 0;}