#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
//#define mp make_pair
//#define OO(x) fixed<<setprecision(x)
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int read(){
	char ch=getchar(); int w=1,c=0;
	for(;!isdigit(ch);ch=getchar()) if (ch=='-') w=-1;
	for(;isdigit(ch);ch=getchar()) c=(c<<1)+(c<<3)+(ch^48);
	return w*c;
}
const int mod=998244353,M=2e5+10;
int n,a[M];
LL pw[M]; 
struct LB{
	int b[20],cnt,fr;
	void clr(){
		ms(b,0);
		cnt=fr=0;
	}
	void ins(int x){
		DF(i,19,0){
			if (x>>i&1){
				if (!b[i]){
					b[i]=x; cnt++;
					return ;
				}
				else x^=b[i];
			}
		}
		fr++;
	}
}b[M],A;
int c[M];
void work(){
	n=read(); A.clr();
	F(i,1,n) b[i].clr(),c[i]=0; 
	F(i,1,n) a[i]=read(),A.ins(a[i]),c[a[i]]++;
	F(i,1,n){
		for (int j=2*a[i];j<=n;j+=a[i]){
			b[j].ins(a[i]);
		} 
	}
	LL ans=pw[A.fr];
	F(i,1,n){
		if (c[i]){
			ans+=pw[c[i]-1]*pw[b[i].fr]%mod;
		}
	}
	ans%=mod; ans=(ans+mod-1)%mod;
	cout<<ans<<"\n";
}
void init(){
	pw[0]=1;
	F(i,1,M-5) pw[i]=pw[i-1]*2%mod;
}
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	int T=read(); init();
	while (T--) work(); return 0;
	return 0;
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/