#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 998244353
int n;
int a[100005],b[100005],f[100005][2];
int solve(int d){
	if(!d)return 1;
	int base=1,pos=0;
	for(int i=1;i<=n;i++){
		if(d&a[i]){
			a[i]-=d;
			b[++pos]=a[i];
		}
		else base=(ll)base*(a[i]+1)%mod;
	}
	f[pos+1][0]=1,f[pos+1][1]=0;
	// for(int i=1;i<=pos;i++)printf("%d ",b[i]);
	// printf("\n");
	for(int i=pos;i>=1;i--){
		f[i][0]=((ll)f[i+1][0]*d+(ll)f[i+1][1]*(b[i]+1))%mod;
		f[i][1]=((ll)f[i+1][1]*d+(ll)f[i+1][0]*(b[i]+1))%mod;
	}
	int ans=0;
	for(int i=1;i<=pos;i++){
		// 0~i-1 1
		// i 0
		ans=(ans+(ll)f[i+1][1^i&1]*base)%mod;
		base=(ll)base*(b[i]+1)%mod;
	}
	// printf("d=%d ans=%d\n",d,ans);
	return (ans+(pos%2==0?solve(d>>1):0))%mod;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	printf("%d",solve(1<<30));
	return 0;
}
// quod erat demonstrandum