/*
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <tuple>

#include <unordered_set>
#include <unordered_map>
#include <set> // lower_bound : <= ; upper_bound : > ; *s.upper_bound(x) de type X
#include <map> // lower_bound : <= ; upper_bound : > ; *m.upper_bound(x) de type pair<X, Y>
#include <stdio.h>
*/

#include <bits/stdc++.h>
#include <numeric>

using namespace std;


#define hmap unordered_map 
#define hset unordered_set 

#define print_var(x) cout << #x << " is " << x << endl;

template<typename T, typename Compare> 
using heap = priority_queue<T, vector<T>, Compare>;

template<typename T> 
T expo(T n, T x){if (x==0) return 1; T k=expo(n, x>>1); return k*k*(x&1 ? n : 1);}

template<typename T> 
T parmi(T k, T n){if (k<0) return 0; if (k==0||k==0)return 1; return (n*parmi(k-1, n-1))/k;}

int64_t MAX = 1e9+7;
int64_t facto(int64_t n, int64_t v){if (n==0)return v; return n*facto(n-1, v) % MAX;}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t; cin >> t; 

	for (int steps=0; steps<t; steps++){
		int64_t n; cin >> n; 
		vector<int64_t> a(n);
		for (int64_t i(0); i<n; i++){
			cin >> a[i];
		}

		vector<int64_t> b(a);
		vector<int64_t> c(a);
		for (int64_t i(1); i<n; i++)
			b[i] &= b[i-1];
		for (int64_t i(n-2); i>=0; i--)
			c[i] &= c[i+1];


		vector<int64_t> find(0);
		if (c[1] == a[0])
			find.push_back(0);
		if (b[n-2] == a[n-1])
			find.push_back(n-1);
		for (int64_t i=1; i<n-1; i++){
			if (a[i] == (b[i-1] & c[i+1])){
				find.push_back(i);
			}
		}
		if (find.size() < 2)
			cout << 0 << endl; 
		else {
			cout << facto(n-2, int64_t(int64_t(int64_t(find.size()%MAX) * int64_t((find.size()-1)%MAX) % MAX) % MAX)) % MAX << endl; 
		}


	}
	

}


