#include <iostream>
#include <utility>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
using namespace std;
using ll = long long int;
#define chmax(x,y)  x = (x > (y)) ? x : (x = (y));
#define chmin(x,y)  x = (x < (y)) ? x : (x = (y));


int main(int argc, char const *argv[])
{
  set<ll> st;
  st.insert(0);
  int N; cin >> N;
  for(int i=0;i<N;++i)
  {
    ll a; cin >> a;
    vector<ll> A;
    for(auto &s : st)
    {
      A.push_back(s^a);
    }
    for(auto &e : A)st.insert(e);
  }
  std::cout << st.size() << std::endl;
}