#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

int main() {
  int n;
  cin >> n;
  set <int> memo;
  memo.insert(0);
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    if (memo.count(x)) {
      continue;
    }
    for (set <int>::iterator it = memo.begin(); it != memo.end(); ++it) {
      memo.insert(x^*it);
    }
  }

  std::cout << memo.size() << std::endl;
}