#include #include #include using namespace atcoder; using mint = modint998244353; using namespace std; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf 1000000001 template struct matrix{ vector> v; int _h,_w; matrix(vector> X){ v = X; _h = X.size(); _w = 0; if(X.size()>0)_w = X[0].size(); } matrix(int h,int w){ v.resize(h,vector(w,e0())); _h = h; _w = w; } void add_element(int from,int to,S x){ v[to][from] = op0(v[to][from],x); } matrix e(){ assert(_h==_w); matrix ret(_h,_w); for(int i=0;i<_h;i++){ for(int j=0;j<_w;j++){ if(i==j)ret.v[i][j] = e1(); else ret.v[i][j] = e0(); } } return ret; } matrix &operator*=(const matrix &another){ matrix ret(_h,another._w); for(int i=0;i<_h;i++){ for(int j=0;j ret = e(); auto temp = *this; while(cnt!=0LL){ if((cnt&1)==1){ ret *= temp; } temp *= temp; cnt>>=1; } return ret; } }; mint op0(mint a,mint b){ return a+b; } mint e0(){ return 0; } mint op1(mint a,mint b){ return a*b; } mint e1(){ return 1; } int main(){ int n; cin>>n; vector a(n); long long s=0,sum =0; rep(i,n){ cin>>a[i]; s ^= a[i]; sum += a[i]; } long long need = 0; if(s==0){ need = sum; } else{ need = sum; rep(i,n){ if((a[i]^s)<=a[i]){ need = min(need,sum - (a[i] - (a[i]^s)) + 1LL); } } } matrix M(2,2); mint temp = mint(3).inv(); rep(i,2){ rep(j,2){ if(i==j)M.add_element(i,j,temp); else M.add_element(i,j,temp*2); } } M = M.pow(need); matrix MM(2,1); MM.v[1][0] = 1; M *= MM; cout<