#include <cmath>
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
#include <string>
#include <map>
#include <cstdlib>
#include <fstream>
#include <cmath>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const int maxn=1e3+50;
const int Mod=1e9+7;

int cnt[30];
string s;
int len;
int T;

ll yh[maxn][maxn];

void init()
{
    yh[0][0]=yh[0][1]=1;
    for (int i=1;i<=1002;i++)
    {
        yh[i][0]=1;
        for (int j=1;j<=i;j++)
            yh[i][j]=(yh[i-1][j-1]+yh[i-1][j])%Mod;
        yh[i][i]=1;
    }
//    
//    for (int i=0;i<=6;i++)
//    {
//        for (int j=0;j<=6;j++)
//            cout<<yh[i][j]<<" ";
//        cout<<endl;
//    }
}

bool check()
{
    int tmp=0;
    for (int i=0;i<26;i++) 
    {
        if (cnt[i] & 1) tmp++;
    }
    if (tmp>1) return false;
    return true;
}

void trim()
{
    for (int i=0;i<26;i++) 
    {
        cnt[i]=cnt[i]>>1;
    }
}
ll solve()
{
    int sum=s.size();
    sum/=2;
    ll ans=1;
    for (int i=0;i<26;i++){
        if (cnt[i]){
    //        cout<<sum<<" "<<cnt[i]/2<<" "<<yh[sum][cnt[i]/2]<<endl;
            ans=(ans*yh[sum][cnt[i]])%Mod;
            sum-=cnt[i];
            
        }
    }
    return ans;
}

int main()
{
    #ifndef ONLINE_JUDGE
        freopen("in.txt","r",stdin);
     //   freopen("out.txt","w",stdout);
    #endif
    init();

    scanf("%d",&T);
    while(T--){
        cin>>s;
        len=s.size();
        mem(cnt,0);
        if (len==1){
            puts("1");
            continue;
        }
        for (int i=0;i<len;i++) cnt[s[i]-'a']++;
        if (!check()){
            puts("0");
            continue;
        }
        trim();
        cout<<solve()<<'\n';
    }
    return 0;
}