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

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int N;
vl A;

void init(){
  cin >> N;
  A = vl( N );
  for( int i = 0; i < N; ++i )
    cin >> A[ i ];
}

void preprocess(){
  sort( A.begin(), A.end(), greater< ll >() );
  for( int i = 0; i < N; ++i )
    if( A[ i ] )
      for( int j = i + 1; j < N; ++j )
        if( __builtin_clzll( A[ i ] ) == __builtin_clzll( A[ j ] ) )
          A[ j ] ^= A[ i ];
}

void solve(){
  int cnt = 0;
  for( int i = 0; i < N; ++i )
    cnt += A[ i ] > 0;
  cout << ( 1LL << cnt ) << endl;
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}