样例能过，不知道自己错在哪。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdlib>
#include<iomanip>
#include<map>
#define int long long
#define db long double
#define lc(p) p<<1
#define rc(p) p<<1|1
#define pii pair<int,int>
#define up(i,l,r) for(int i=(l);i<=(r);i++)
#define down(i,l,r) for(int i=(l);i>=(r);--i)
#define p_b push_back
#define m_p make_pair
using namespace std;
const int mod=1e9+7;
int bd[1000007];
int dep[1000007];
void border(string s){
    int l=s.length();
    dep[0]=0;
    for(int i=1;i<l;i++){
        int ind=bd[i-1];
        while(ind&&s[ind]!=s[i]){ind=bd[ind];}
        if(s[ind]==s[i])ind++;
        bd[i]=ind;
        if(ind)dep[i]=dep[ind-1]+1;
        else dep[i]=0;
    }
}
void slv(){
    string s;
    cin>>s;
    border(s);
    int ans=1;
    int l=s.length();
    int ind=1;
    for(int i=1;i<l;i++){
        //cout<<ind<<" "<<i<<" "<<dep[i]<<endl;
        while(ind&&s[ind]!=s[i])ind=bd[ind-1];
        //cout<<ind<<endl;
        if(s[ind]==s[i])ind++;
        //cout<<ind<<endl;
        while(ind&&2*bd[ind-1]>i+1)ind=bd[ind-1];
        //cout<<dep[ind-1]<<endl<<endl;
        ans=ans*(dep[ind-1]+1)%mod;
    }
    //cout<<endl;
    cout<<ans<<endl;
}
void MT(){
    int t;
    cin>>t;
    while(t--)slv();
}
signed main(){
    ios::sync_with_stdio(0);
    MT();
}