#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

ll my_pow(ll x,ll y){
	if(y==0) return 1;
	else if(y&1) return (x*my_pow(x,y^1))%mod;
	return my_pow((x*x)%mod,y>>1);
}

void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	solve();
}



void solve(){
	int N;
	cin>>N;
	ll x=0,sum=0;
	vector<ll> p(N);
	rep(i,N){
		cin>>p[i];
		x^=p[i];
		sum+=p[i];
	}
	ll ans=sum;
	if(x){
		rep(i,N){
			chmin(ans,sum-p[i]+(p[i]^x));
		}
		ans++;
	}
	//cout<<ans<<"\n";
	cout<<(mod+(((mod+1)/2)*(1-my_pow(my_pow(-3,mod-2),ans)))%mod)%mod<<"\n";
}