#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iostream>
#define N 1100
#define LL long long
#define mmod 1000000007
using namespace std;
LL c[N][N],cnt[30],ans;
int len,m;
char s[N];
int main()
{
    c[0][0]=1;
    for(int i=1;i<N;i++)
    {
        c[i][0]=1;
        for(int j=1;j<=i;j++) 
            c[i][j]=(c[i-1][j]+c[i-1][j-1])%mmod;
    }
    int z;
    scanf("%d",&z);
    while(z--)
    {
        scanf("%s",s+1);
        len=strlen(s+1);
        memset(cnt,0,sizeof(cnt));
        ans=1;
        for(int i=1;i<=len;i++) cnt[s[i]-'a']++;
        int t=0;
        for(int i=0;i<26;i++) if(cnt[i]%2) t++;
        m=len/2;
        if(len%2)
        {
            if(t!=1) {printf("0\n");continue;}
            
        }
        else
        {
            if(t) {printf("0\n");continue;}
        }
        for(int i=0;i<26;i++)
        {
            ans=(ans*c[m][cnt[i]/2])%mmod;
            m-=cnt[i]/2;
            if(m==0) break;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}