#include<bits/stdc++.h>
#define lowbit(x) x&(-x)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef __int128 lll;
typedef long double LD;
typedef pair<ll,ll> pll;
typedef pair<ll,pll> plll;
typedef pair<int,int> pii;

const ll MOD=998244353;
const ll INF=0x3f3f3f3f3f3f3f3f;
const LD eps=1e-9;

inline ll read()
{
	ll ans=0, f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9') ans=ans*10+c-'0', c=getchar();
	return ans*f;
}

inline ll qpow(ll x,ll y)
{
	ll res=1;
	while(y)
	{
		if(y&1) res=(res*x)%MOD;
		x=(x*x)%MOD;
		y>>=1;
	}
	return res;
}

const int N=1e5+500;

inline bool gett(int x,int y)
{
	return x&(1<<y);
}

int n, m=0;
int w[N];

ll ans=0;
ll f[N][2], pre[N];

void init()
{
	n=read();
	for(int i=1;i<=n;i++) w[i]=read();
	return ;
}

void solve()
{
	int s, tag;
	ll x, y;
	for(int i=30;i>=0;i--)
	{
		s=(1<<i)-1, tag=0;
		pre[0]=1;
		f[n+1][1]=0;
		f[n+1][0]=1;
		
		for(int j=1;j<=n;j++)
		{
			pre[j]=(w[j]&s)+1;
			if(gett(w[j],i))f[j][1]=(w[j]&s)+1, f[j][0]=s+1;
			else f[j][0]=(w[j]&s)+1, f[j][1]=0;
			pre[j]%=MOD ,f[j][0]%=MOD, f[j][1]%=MOD;
		}
		
		for(int j=2;j<=n;j++) pre[j]=(pre[j-1]*pre[j])%MOD;
		
		for(int j=n-1;j>=1;j--)
		{
			x=f[j][0], y=f[j][1];
			f[j][0]=(f[j+1][0]*x+f[j+1][1]*y)%MOD;
			f[j][1]=(f[j+1][0]*y+f[j+1][1]*x)%MOD;
		}
		
		for(int j=1;j<=n;j++)
		{
			if(gett(w[j],i)) ans=(ans+(pre[j-1]*f[j+1][tag]))%MOD, tag^=1;
		}
		
		if(tag) break;
		if(i==0) ans++;
	}
	
	cout<<ans;
	return ;
}

int main()
{
	init();
	solve();
	
	return 0;
}