#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

typedef vector<vector<int> > matrix;

int rank2(matrix A) {
  const int n = A.size(), m = A[0].size();
  int r = 0;
  for (int i = 0; r < n && i < m; ++i) {
    int pivot = r;
    for (int j = r+1; j < n; ++j)
      if (abs(A[j][i]) > abs(A[pivot][i])) pivot = j;
    swap(A[pivot], A[r]);
    if (abs(A[r][i]) <= 0) continue;
    for (int k = m-1; k >= i; --k)
      A[r][k] /= A[r][i];
    for(int j = r+1; j < n; ++j)
        for(int k = i; k < m; ++k){
            A[j][k] -= A[r][k] * A[j][i];
            if(A[j][k] % 2 != 0) A[j][k] = 1;
        }
    ++r;
  }
  return r;
}

int main()
{
    int n;
    cin>>n;
    VI A(n);
    vector<vector<int> > mat(n, vector<int>(64));
    FOR(i,n){
        scanf("%d",&A[i]);
        FOR(j,61) if(A[i] & (1LL<<j)) {
            mat[i][j] = 1;
        }
    }
    cout<<(1LL<<rank2(mat))<<endl;

    return 0;
}