#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define INF 0x3f3f3f3f
const int N=200005;
const int mod=1e9+7;

string n;
int t,a[26],c[1005][1005];

int main() {
    cin>>t;
    memset(c, 0, sizeof(c));
    for (int i=0; i<1005; i++) {
        c[i][0]=c[i][i]=1;
        for (int j=1; j<i; j++) {
            c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
        }
    }
    while (t--) {
        cin>>n;
        memset(a, 0, sizeof(a));
        int len=n.length();
        for (int i=0; i<len; i++) {
            a[n[i]-'a']++;
        }
        long long sum=0;
        for (int i=0; i<26; i++) {
            if (a[i]%2==1) {
                a[i]--;
                sum++;
            }
        }
        if (sum>=2) {
            cout<<"0"<<endl;
            continue;
        } else if (sum==1&&len%2==0) {
            cout<<"0"<<endl;
            continue;
        }
        int flag=len/2;
        sum=1;
        for (int i=0; i<26; i++) {
            sum*=c[flag][a[i]/2];
            sum%=mod;
            flag-=a[i]/2;
        }
        cout<<sum<<endl;
    }
    return 0;
}