#include <bits/stdc++.h>

#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using ld = long double;
template <typename T>
vector<T> Vec(int n, T v)
{
    return vector<T>(n, v);
}
template <class... Args>
auto Vec(int n, Args... args)
{
    auto val = Vec(args...);
    return vector<decltype(val)>(n, move(val));
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = (ll)1e9 + 7LL;
constexpr ld PI = static_cast<ld>(3.1415926535898);

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 10;


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    constexpr int DIGIT = 61;
    vector<bitset<DIGIT>> bits(N);
    for (int i = 0; i < N; i++) {
        ll n;
        cin >> n;
        bits[i] = bitset<DIGIT>(n);
    }

    int dim = 0;
    int pos = 0;
    for (int i = 0; i < DIGIT and pos < N; i++, pos++) {
        if (not bits[pos][i]) {
            int piv = -1;
            for (int k = pos + 1; k < N; k++) {
                if (bits[k][i]) {
                    piv = k;
                    break;
                }
            }
            if (piv != -1) {
                swap(bits[pos], bits[piv]);
            } else {
                pos--;
                continue;
            }
        }
        for (int j = 0; j < N; j++) {
            if (pos == j) {
                continue;
            }
            if (bits[j][i]) {
                bits[j] ^= bits[pos];
            }
        }
        dim++;
    }

    cout << (1LL << dim) << endl;
    return 0;
}