#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 998244353
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}


template<typename T=int>
struct BinaryBasis{
    vector<T> base;
    
    BinaryBasis(){}

    bool add(T bit){
        for(auto &x:base) chmin(bit,bit^x);
        if(bit){
            base.push_back(bit);
            return true;
        }
        return false;
    }

    T solve(T r){
        int ret=0;
        for(auto &x:base)if(chmin(r,r^x)) ret^=x;
        if(r) return -1;
        return ret;
    }

    void normalize(){
        for(int i=(int)base.size()-1;i>=0;i--)
            for(int j=i-1;j>=0;j--) base[i]=min(base[i],base[i]^base[j]);
    }

    // check normalized this and r
    bool eq(BinaryBasis<T> &r){
        return base==r.base;
    }

    int size(){
        return (int)base.size();
    }
};


signed main(){
    int n;cin>>n;
    BinaryBasis<ll> bs;
    rep(i,n){
        ll t;cin>>t;
        bs.add(t);
    }
    cout<<(1ll<<bs.size())<<endl;
    return 0;
}