#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

struct OrthonormalBasis {
    const int n = 60;
    vector<long long> basis;

    OrthonormalBasis() : basis(n) {}

    void add(long long x){
        x = get_min(x);
        if(x == 0)  return;

        int msb = 63 - __builtin_clzll(x);
        for(int i = 0; i < n; ++i){
            if(basis[i] >> msb & 1) basis[i] ^= x;
        }
        basis[msb] = x;
    }

    long long operator[](int i) { return basis[i]; }
    
    long long get_min(long long x){
        for(int i = n - 1; i >= 0; --i){
            if(x >> i & 1)  x ^= basis[i];
        }
        return x;
    }

    long long get_max(long long x){
        for(int i = n - 1; i >= 0; --i){
            if(~x >> i & 1) x ^= basis[i];
        }
        return x;
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    OrthonormalBasis vec;
    for(int i = 0; i < N; ++i){
        ll A;
        cin >> A;
        vec.add(A);
    }

    int cnt = 0;
    for(int i = 0; i < 60; ++i){
        cnt += vec[i] > 0;
    }

    cout << (1LL << cnt) << endl;

    return 0;
}