#include <bits/stdc++.h>
using namespace std;
#define bokusunny ios::sync_with_stdio(false), cin.tie(nullptr);

template <class T>
int GaussJordan_XOR(vector<T> &A) {
  int N = (int)A.size();
  int rank = 0;
  for (int bit = 62; bit >= 0; bit--) {
    int pivot = -1;
    for (int i = rank; i < N; i++) {
      if (A[i] >> bit & 1) {
        pivot = i;
        break;
      }
    }
    if (pivot == -1) continue;

    for (int i = 0; i < N; i++) {
      if (i == pivot) continue;
      if (A[i] >> bit & 1) A[i] ^= A[pivot];
    }

    swap(A[rank], A[pivot]);
    rank++;
  }

  return rank;
}

void solve() {
  int N;
  cin >> N;
  vector<long long> A(N);
  for (int i = 0; i < N; i++) cin >> A[i];

  auto rank = GaussJordan_XOR(A);
  cout << (1LL << rank) << endl;
}

int main() {
  bokusunny;
  solve();

  return 0;
}