#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<queue>
#include<stack>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
const int maxn=2e6+10;
const int maxm=1e6+10;
const ull mod=1e9+7;
const ull base1=131;
const ull base2=19660813;
const ll maxxn=0x7ffffff;
const ll minxn=-0x7ffffff;
const db inf=1e13;
inline ll read(){
    ll x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}
int t;
char s[maxn];
int len;
int nxt[maxn],cnt[maxn];
ll ans;
inline void get_nxt(){
    for(int i=2,j=0;i<=len;i++){
        while(j&&s[i]!=s[j+1]) j=nxt[j];
        if(s[i]==s[j+1]) j++;
        nxt[i]=j;
        cnt[i]=cnt[j]+1;
    }
}
inline void get_ans(){
    for(int i=2,j=0;i<=len;i++){
        while(j&&s[i]!=s[j+1]) j=nxt[j];
        if(s[i]==s[j+1])j++;
        while((j<<1)>i) j=nxt[j];
        ans=(ans*(ll)(cnt[j]+1))%mod;
    }
}
int main(){
    scanf("%d",&t);
    while(t--){
        ans=1;
        nxt[1]=0,cnt[1]=1;
        scanf("%s",s+1);
        len=strlen(s+1);
        get_nxt();
        get_ans();
        printf("%lld\n",ans);
    }
    return 0;
}