#include <bits/stdc++.h>
using namespace std;
#define forw(_,l,r) for(auto _=(l);_<(r);++_)
#define fors(_,r,l) for(auto _=(r);_>(l);--_)
#define RN return
#define MT make_tuple
#define fastio cin.tie(0),cout.tie(0),ios::sync_with_stdio(0);
#define clz __builtin_clz

void read(){}
template <typename T,typename...Types>
void read(T& a,Types&...args){
  a=0; char c=' ';
  while(isspace(c))c=getchar();
  while(isdigit(c))a=10*a+c-'0',c=getchar();
  read(args...);
}
typedef long long ll;
const int NUM=2e5+10;
int prime[NUM/5]{},pcnt=0,lp[NUM]{},rem[NUM]{};
char lpc[NUM]{};
int fact[2*int(sqrt(NUM))]{},ftop;
void factor(int x){
	ftop=0;fact[ftop++]=1;
	for(;x!=1;ftop*=(lpc[x]+1),x=rem[x])
		for(int j=0,base=0;j<lpc[x];++j,base+=ftop)
			forw(k,base,base+ftop)fact[ftop+k]=fact[k]*lp[x];
}
void euler(){
	lp[1]=rem[1]=1;
	forw(i,2,NUM){
		if(!lp[i])prime[pcnt++]=i,lp[i]=i,rem[i]=lpc[i]=1;
		int p; ll t;
		for(int j=0;j<pcnt&&(t=i*(p=prime[j]))<NUM;++j){
			lp[t]=p;
			if(i%p)rem[t]=i,lpc[t]=1;
			else{rem[t]=rem[i],lpc[t]=lpc[i]+1;break;}
		}
	}
}
void test(){
	factor(48);
	forw(i,0,ftop)cout<<fact[i]<<' ';
}
int n;set<int> vis;
int cnt[NUM]{},mat[70],rk;
void clear(){
	for(auto x:vis)cnt[x]=0;
	vis.clear();
}
void gaussClear(){memset(mat,0,sizeof(mat));rk=0;}
void gauss(int x){
	forw(i,0,31)if((x>>i)&1){int&r=mat[i];if(r)x^=r;else{r=x;++rk;break;}}
}
const int MOD=998244353;
struct fn{
	int n;fn(int n=0):n(n){}
	fn operator+(fn y){int t=n+y.n;RN t>=MOD?t-MOD:t;}
	fn operator-(fn y){int t=n-y.n;RN t<0?t+MOD:t;}
	fn operator*(fn y){RN int(1LL*n*y.n%MOD);}
	fn ksm(int b){fn r=1;for(fn a=n;b;b/=2,a=a*a)if(b&1)r=r*a;RN r;}
};
fn calc(){
	gaussClear(); int var=0; 
	for(auto x:vis)gauss(x),var+=cnt[x];
	fn ret=fn(2).ksm(var-rk)-1;
	for(auto x:vis){
		gaussClear(); var=0;
		fn mult=fn(2).ksm(cnt[x]-1)-1;
		factor(x);forw(i,0,ftop)gauss(i),var+=cnt[i];
		ret=ret+fn(2).ksm(var-rk);
		if(!mult.n)continue;
		++var,gauss(x);
		ret=ret+fn(2).ksm(var-rk)*mult;
	}RN ret;
}
int main(){
	fastio;
	euler(); //test();
	int t; read(t);
	forw(_,0,t){
		clear();
		read(n);forw(i,0,n){int x;read(x);vis.insert(x);++cnt[x];}
		cout<<calc().n<<endl;
	}
	RN 0;
}