#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;

#define FOR(i,a,b) for(int (i)=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RANGE(vec) (vec).begin(),(vec).end()

using namespace std;

std::vector<unsigned long long> sweep_ull(std::vector<unsigned long long> A)
{
        int N = A.size();
        for (int i = 0; i < N; ++i)
        {
            int pivot = i;
            for (int j = i+1; j < N; ++j)
            {
                if ( __builtin_clzl(A[j]) < __builtin_clzl(A[pivot]))
                    pivot = j;
            }
            if (pivot != i)
                swap(A[i], A[pivot]);

            for (int j = i+1; j < N; ++j)
            {
                if (__builtin_clzl(A[j]) == __builtin_clzl(A[i]))
                    A[j] ^= A[i];
            }
        }
        return A;
}
unsigned long long mpow(unsigned long long a, int k)
{
        unsigned long long  b = 1;
        while (k > 0)
        {
            if (k & 1)
                b = (b*a);
            a = (a*a);
            k >>= 1;
        }
        return b;
}

class HappyXorHard
{
public:
    void solve(void) {
        int N;
        cin>>N;
        vector<ull> A(N);
        REP(i,N) cin>>A[i];

        A = sweep_ull(move(A));
        int k = count_if(RANGE(A), [](unsigned long long a) { return (a>0); });

        cout<<mpow((ull)2,k)<<endl;
    }
};

#if 1
int main(int argc, char *argv[])
{
        ios::sync_with_stdio(false);
        auto obj = new HappyXorHard();
        obj->solve();
        delete obj;
        return 0;
}
#endif