#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define FOR(i, f, t)        for(int(i)=(f);(i)<(t);(++i))
#define RREP(i, n)          for(int(i)=(n)-1;(i)>=0;--(i))
const int MOD = int(1e9+7);

int N;
ll A[5555];

class uf_ {
public:
    vector<int> node;
    uf_(int n) : node(n, -1){;}
    void con(int n, int m){
        n = root(n); m = root(m); if(n == m) return;
        node[n] += node[m]; node[m] = n;
    }
    bool is_con(int n, int m){ return root(n) == root(m); }
    int root(int n){ return (node[n] < 0) ? n : node[n] = root(node[n]); }
    int size(int n){ return -node[root(n)]; }
};

bool f[66];

int main(){
    do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0);
    cin >> N;
    REP(i,N) cin >> A[i];

    uf_ uf(62);

    REP(i,N){
        ll a = A[i];
        int k = 0;
        REP(j,61){
            if((a>>j)&1){ k = j; break; }
        }
        FOR(j,k+1,61) if((a>>j)&1) uf.con(k,j);
    }

    ll res = 1;
    REP(i,61){
        int k = uf.root(i);
        if(f[k]) continue;
        f[k] = true;

        ll mask = 0;
        REP(j,61){
            if(!uf.is_con(i,j)) continue;
            mask |= 1LL<<j;
        }
        set<ll> s; s.insert(0);
        REP(j,N){
            ll a = A[j]&mask;
            set<ll> t;
            for(auto it = s.begin(); it != s.end(); ++it){
                t.insert(*it ^ a);
            }
            s.insert(t.begin(), t.end());
        }
        res *= s.size();
    }

    cout << res << endl;
    return 0;
}