#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <ctime>
using namespace std;

const long long MOD = 1000000007;

// nCk mod p, O(1)
// precomputation O(size)
class combination_mod{
public:
    const long long mod;
    const long long size;
    
    vector<long long> fact;    //n!
    vector<long long> fact_inv;    // (n!)^-1

    void make_fact(){
        fact[0] = 1;
        for(long long i=1; i<size; i++){
            fact[i] = fact[i-1]*i % mod;
        }
    }

    void make_fact_inv(){
        fact_inv[0] = fact_inv[1] = 1;
        for(long long i=2; i<size; i++){
            fact_inv[i] = fact_inv[mod%i] * (mod - mod/i) % mod;    // x ^ -1
        }
        for(int i=2; i<size; i++){
            fact_inv[i] = fact_inv[i-1] * fact_inv[i] % mod;    // x! ^ -1
        }
    }

    combination_mod(long long mod_, long long size_ = 2000000) : mod(mod_), size(size_+1){
        fact.resize(size);
        fact_inv.resize(size);
        make_fact();
        make_fact_inv();
    }

    //nCk mod p O(1)
    long long comb(long long n, long long k){
        if(k==0 || n==k) return 1;
        long long ret = fact[n] * fact_inv[k] % mod * fact_inv[n-k] % mod;
        return ret;
    }
};

int main(){
    int t;
    scanf("%d", &t);

    combination_mod comb(MOD, 2500);

    while(t--){
        string s;
        cin >> s;
        int n = s.size();
        vector<int> cnt(26);
        for(int i=0; i<n; i++){
            cnt[s[i]-'a']++;
        }

        int odd = 0;
        int c_odd = 0;
        for(int i=0; i<26; i++){
            if(cnt[i]%2==1){
                odd++;
                c_odd = i;
            }
        }

        if(n%2==0){
            if(odd != 0){
                puts("0");
                continue;
            }
            long long ans = comb.fact[n/2];
            for(int i=0; i<26; i++){
                if(cnt[i]==0) continue;
                ans = ans * comb.fact_inv[cnt[i]/2];
                ans %= MOD;
            }

            printf("%I64d\n", ans);
        }else{
            if(odd != 1){
                puts("0");
                continue;
            }

            long long ans = comb.fact[n/2];
            for(int i=0; i<26; i++){
                if(i == c_odd) cnt[i]--;
                if(cnt[i]==0) continue;
                ans = ans * comb.fact_inv[cnt[i]/2];
                ans %= MOD;
            }
            printf("%I64d\n", ans);
        }

    }
    return 0;
}