#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
const int dy[] = {-1,0,1,0};
const int dx[] = {0,1,0,-1};
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}

template<int W>
struct BinMat {
  typedef bitset<W> Vec;
  vector<Vec> v;
  int h,w;
  Vec& operator[](int i) { return v[i]; }
  const Vec& operator[](int i) const { return v[i]; }
  BinMat() : h(),w() {}
  BinMat(int h, int w) : v(h), h(h), w(w) {}
  template<class T>
  BinMat(const vector<vector<T> > &u) : v(u.size()), h(u.size()),w(u[0].size()) {
    REP(i,h) {v[i]=0; REP(j,w)v[i][j]=u[i][j];}
  }
  static BinMat identity(int n) {
    BinMat A(n,n);
    REP(i,n) A[i][i] = 1;
    return A;
  }
  BinMat operator*(const BinMat &B) const {
    BinMat res(h,B.w);
    REP(i,h)REP(j,B.w)REP(k,w) res[i][j] = res[i][j]^(v[i][k]&B[k][j]);
    return res;
  }
  BinMat& operator*=(const BinMat &B) { return *this = *this * B; }
  BinMat& operator+=(const BinMat &B) { REP(i,h)v[i]^=B[i]; return *this; }
  BinMat& operator-=(const BinMat &B) { REP(i,h)v[i]^=B[i]; return *this; }
  BinMat operator+(const BinMat &B) const { return BinMat(*this)+=B; }
  BinMat operator-(const BinMat &B) const { return BinMat(*this)-=B; }
  BinMat pow(ll n) {
    BinMat A(*this), B = identity(h);
    for (;n;n>>=1) { if (n&1) B *= A; A *= A;}
    return B;
  }
  friend ostream &operator<<(ostream &os, const BinMat &B) {
    REP(i,B.h) { REP(j,B.w) os << B[i][j]; os << endl; }
    return os;
  }
  int rank() const {
    BinMat B(h,w);
    REP(i,h) B[i] = v[i];
    int y,r=0;
    REP(x,w) {
      for (y=r; y<h&&!B[y][x]; ++y);
      if (y == h) continue;
      swap(B[r],B[y]);
      for (y=r+1; y<h; ++y) if (B[y][x]) B[y] ^= B[r];
      r++;
    }
    return r;
  }
};

int main() {
  int n;
  while(input(n)) {
    BinMat<100> A(n,70);
    REP(i,n) {
      ll a; cin >> a;
      A[i] = a;
    }
    int r = A.rank();
    cout << (1LL<<r) << endl;
  }
}