#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 805
#define M 1005
#define MOD 1000000007
using namespace std;
int C[N][N],a[N];
char st[M];
int main()
{
  int t;
  cin>>t;
  for (int i=1;i<=500;i++)
  {
  C[i][0]=1;
  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--)
  {
  long long ans=1;
  memset(a,0,sizeof(a));
   scanf("%s",st);     
   int len=strlen(st);
   for (int i=0;i<len;i++)
    a[st[i]-'a'+1]++;
   if (!(len%2)) 
     {
     int flag=1;
     for (int i=1;i<=26;i++)
      if (a[i]%2) {
                  flag=0;
                  ans=0;
                  break;
                  }
     if (flag) {
               len/=2;
               for (int i=1;i<=26 && len;i++)
               {
                a[i]/=2;
                ans=((long long)ans*C[len][a[i]])%MOD;
                len-=a[i];
               } 
               }         
     }
           else {
                int cnt=0;
                len=(len-1)/2;
                for (int i=1;i<=26;i++)
                 if (a[i]%2)  cnt++;
                if (cnt!=1) ans=0;
                else {
                     for (int i=1;i<=26 && len;i++)
                      if (!(a[i]%2)) {
                                   a[i]/=2;
                                   ans=((long long)ans*C[len][a[i]])%MOD;
                                   len-=a[i];
                                   }
                      else {
                           a[i]=(a[i]-1)/2;
                           ans=((long long)ans*C[len][a[i]])%MOD;
                           len-=a[i];
                           }
                     }
                }
   printf("%I64d\n",ans);
  }
}