#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define FIN(i,n) for(int i=0;i<n;i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define vp vector<pair < int, int > >
#define vll vector<long long>
#define F first
#define S second
#define MINV(v) *min_element(v.begin(),v.end())
#define MINIV(v) min_element(v.begin(),v.end())-v.begin()
#define all(v) v.begin(), v.end()
#define pb push_back
#define TR(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)

// make_pair()
//vector<vector<char>> v(r, vector<char> (c,0));
int mod=1e9+7;
int INF=1e18;

int fact[200006];
int invfact[200006];
const int N=2e5+5;
int naturalNumInverse[N+1];

bool isPrime(int n){if(n<=1)return false;if(n<=3)return true;
    if(n%2==0||n%3==0)return false;for(int i=5;i*i<=n;i=i+6)
    if(n%i==0||n%(i+2)==0)return false;return true;}

int nCr(int n,int r){int res=1;if(n<r)return -1;r=min(r,n-r);
    return ((fact[n]*invfact[r])%mod *invfact[n-r])%mod;
}

int nPr(int n,int r){int res=1;if(n<r)return -1;
    loop(i,0,r)res*=(n-i);return res;}


int modexp(int x,int y){
    int res=1;
    while(y>1){
        if(y%2==1){
            res = (res*x)%mod;
        }
        x=(x*x)%mod;
        y/=2;
    }
    return res;
}
void solve()
{
    int n;
    cin>>n;
    vll v(n);
    FIN(i,n) cin>>v[i];
    int req=v[0]&v[1];
    for(int i=2;i<n;i++){
        req = req & v[i];
    }
    int ctr=0;
    for(int i=0;i<n;i++)
        if(v[i]==req) ctr++;
    if(ctr<2){
        cout<<0<<"\n";
        return;
    }
    int ans=1;
    ans=(ans*nCr(ctr,2))%mod;
    ans=(ans*2)%mod;
    ans=(ans*fact[n-2])%mod;
    cout<<ans<<"\n";


}

signed main(){
    fast
    fact[0]=1;
    fact[1]=1;
    invfact[0]=1;
    invfact[1]=1;
    for(int i=2;i<200006;i++){
        fact[i]=(fact[i-1]*i)%mod;
    }
    naturalNumInverse[0] = naturalNumInverse[1] = 1;
    for (int i = 2; i <= N; i++)
        naturalNumInverse[i] = naturalNumInverse[mod % i] * (mod - mod / i) % mod;
    for(int i=2;i<200006;i++){
        invfact[i]=(invfact[i-1]*naturalNumInverse[i])%mod;
    }
    // cout<<fact[4]<<' ';
    // cout<<invfact[4]<<' ';
    // cout<<nCr(,4)<<' ';
    int t=1;
    cin>>t;
    while(t--)
        solve();
    return 0;
}