#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
const int mod=998244353;
int n;
int a[100005];
int dp[100005][2];
int solve(vector<int> p,int x){
	int b=0;
	sort(p.begin(),p.end());
	while((1<<b)*2<=p.back())b++;
	if(x>=(1<<(b+1)))return 0;
	for(int i=0;i<=n;i++)dp[i][0]=dp[i][1]=0;
	dp[0][0]=1;
	for(int i=0;i<n-1;i++){
		if(p[i]>=(1<<b)){
			int l=p[i]+1-(1<<b);
			dp[i+1][0]=dp[i][1]*l%mod+dp[i][0]*(1<<b)%mod;
			dp[i+1][1]=dp[i][0]*l%mod+dp[i][1]*(1<<b)%mod;
			dp[i+1][0]%=mod,dp[i+1][1]%=mod;
		}
		else{
			dp[i+1][0]=dp[i][0]*(p[i]+1)%mod;
			dp[i+1][1]=dp[i][1]*(p[i]+1)%mod;
		}
	}
	int res=dp[n-1][x>=(1<<b)];
	if(p.back()>=(1<<b)){
		p.back()-=(1<<b);
		res+=solve(p,x^(1<<b));res%=mod;
	}
	return res;
}
int rdp[100005][65];
signed main(){
	n=read();
	for(int i=1;i<=n;i++)a[i]=read();
	sort(a+1,a+n+1);
	if(n<=2000){
		vector<int> p;for(int i=1;i<=n;i++)p.push_back(a[i]);
		cout<<solve(p,0)<<"\n";
	}
	if(a[n]<=50){
		rdp[0][0]=1;
		for(int i=1;i<=n;i++){
			for(int j=0;j<64;j++){
				if(!rdp[i-1][j])continue;
				for(int k=0;k<=a[i];k++){
					rdp[i][(j^k)]+=rdp[i-1][j];
					rdp[i][(j^k)]%=mod;
				}
			}
		}
		cout<<rdp[n][0]<<"\n";
		return 0;
	}
	vector<int> p;for(int i=1;i<=n;i++)p.push_back(a[i]);
	cout<<solve(p,0)<<"\n";
	return 0;
}
//look at my code
//my code is amazing