lg2375

#define rep(i,x,y) for(register int i=x;i<=y;++i)
#define ll long long
using namespace std;
const int N=1e6+7;
const ll mod=1e9+7;
char str[N];
int len,T,nm[N],nxt[N];
inline void (){
	int k=0;nm[1]=1;
	rep(i,2,len){
		while(k&&str[i]!=str[k+1])k=nxt[k];
		if(str[i]==str[k+1])k++;
		nxt[i]=k;
		nm[i]=nm[k]+1;
	}
}
inline void solve(ll &ans){
	int k=0;
	rep(i,2,len){
		while(k&&str[i]!=str[k+1])k=nxt[k];
		if(str[i]==str[k+1])k++;
		while(2*k>i)k=nxt[k];
		ans=ans*(nm[k]+1)%mod;
	}
}
int main(){
	scanf("%d",&T);
	while(T--&&~scanf("%s",str+1)){
		ll ans=1;len=strlen(str+1);
		memset(nxt,0,sizeof nxt);
		pre();
		solve(ans);
		printf("%lldn",ans);
	}
	return 0;
}