#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
#define inf 1e9
#define pii pair<int,int>
#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 wh(lzm) while(lzm--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
using namespace std;
int read(){
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*f;
}
const int mod=998244353,maxn=1100005;
int qpow(int x,int y){
	int rt=1;
	for(;y;y>>=1,x=1ll*x*x%mod) if(y&1) rt=1ll*rt*x%mod;
	return rt;
}
void inc(int &x,int y){ x=(x+y>=mod)?(x+y-mod):(x+y); }
void dec(int &x,int y){ x=(x>=y)?(x-y):(x+mod-y); }
void mul(int &x,int y){ x=1ll*x*y%mod; }
int add(int x,int y){ return (x+y>=mod)?(x+y-mod):(x+y); }
int sub(int x,int y){ return (x>=y)?(x-y):(x+mod-y); }
int prod(int x,int y){ return 1ll*x*y%mod; }
void chkmax(int &x,int y){ x=max(x,y); }
void chkmin(int &x,int y){ x=min(x,y); }
int n,m,a[maxn],f[maxn][2],pre[maxn];
signed main(){
	n=read();
	F(i,1,n) a[i]=read();
	int ans=0;
	dF(i,30,0){
		int S=(1<<i)-1,fl=0;
		pre[0]=1,f[n+1][1]=0,f[n+1][0]=1;
		F(j,1,n){
			pre[j]=(a[j]&S)+1;
			if(a[j]&(1<<i)) {
				f[j][0]=S+1;
				f[j][1]=(a[j]&S)+1;
			}
			else{
				f[j][0]=(a[j]&S)+1;
				f[j][1]=0; 
			}
		}
		F(j,1,n) mul(pre[j],pre[j-1]);
		dF(j,n-1,1) {
			int x=f[j][0],y=f[j][1];
			f[j][0]=add(1ll*x*f[j+1][0]%mod,1ll*y*f[j+1][1]%mod);
			f[j][1]=add(1ll*y*f[j+1][0]%mod,1ll*x*f[j+1][1]%mod);
		}
		F(j,1,n) if(a[j]&(1<<i)) inc(ans,1ll*pre[j-1]*f[j+1][fl]%mod),fl^=1;
		if(fl) break;
		if(!i) inc(ans,1);
	}
	cout<<ans;
}