#include<bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;

#define CIN( LL , A ) LL A; cin >> A 
#define GETLINE( A ) string A; getline( cin , A ) 
#define GETLINE_SEPARATE( A , SEPARATOR ) string A; getline( cin , A , SEPARATOR ) 
#define FOR_LL( VAR , INITIAL , FINAL_PLUS_ONE ) for( ll VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) 
#define FOR_ITR( ARRAY , ITR , END ) for( auto ITR = ARRAY .begin() , END = ARRAY .end() ; ITR != END ; ITR ++ ) 
#define REPEAT( HOW_MANY_TIMES ) FOR_LL( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) 
#define RETURN( ANSWER ) cout << ( ANSWER ) << endl; return 0 
#define DOUBLE( PRECISION , ANSWER ) cout << fixed << setprecision( PRECISION ) << ( ANSWER ) << endl; return 0 
#define MIN( A , B ) A < B ? A : B;
#define MAX( A , B ) A < B ? B : A;
template <typename T> inline T Distance( const T& a , const T& b ){ return a < b ? b - a : a - b; }

constexpr const ll D = 30;
constexpr const ll P = 998244353;

int main(){
  CIN( ll , N );
  bool b[D] = {};
  ll d[D];
  CIN( ll , Ai );
  FOR_LL( j , 0 , D ){
    d[j] = Ai % 2;
    Ai /= 2;
  }
  N--;
  FOR_LL( i , 0 , N ){
    cin >> Ai;
    FOR_LL( j , 0 , D ){
      bool& bj = b[j];
      if( ! bj ){
	if( d[j] != Ai % 2 ){
	  bj = true;
	}
	Ai /= 2;
      }
    }
  }
  ll count = 0;
  FOR_LL( j , 0 , D ){
    if( b[j] ){
      count++;
    }
  }
  ll answer = 1;
  REPEAT( count ){
    answer = ( answer * 2 ) % P;
  }
  RETURN( answer );
}