#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
 
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
 
using namespace std;
 
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
 
const int INF=1<<29;
const double EPS=1e-9;
 
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int main(int argc, char const *argv[]) {
    int N;
    std::vector<int> v;
    cin >> N;
    for (int i = 0; i < N; ++i) {
        int temp;
        cin >> temp;
        v.push_back(temp);
    }

    std::vector<int> dp(32768);
    dp[0] = 1;
    for (int i = 0; i < N; ++i) {
        std::vector<int> newdp(32768);
        for(int j = 0; j < 32768; j++) {
            newdp[j] |= dp[j];
            newdp[j ^ v[i]] |= dp[j]; 
        }
        for (int j = 0; j < 32768; ++j) {
            dp[j] = newdp[j];
        }
    }
    

    int ans = 0;
    for (int i = 0; i < 32768; ++i) {
        if (dp[i] == 1) {
            ans++;
        }
    }
    cout << ans << endl;

    return 0;
}