#include <bits/stdc++.h>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i, n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define INF 1e9

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};

int main() {
    int n;
    cin >> n;
    vi num(n);
    REP(i, n) {
        cin >> num[i];
    }

    vb dp(1 << 14, false);
    dp[0] = true;
    REP(j, n) {
        vb dp_stk = dp;
        REP(i, 1 << 14) {
            if (dp[i]) {
                dp_stk[i ^ num[j]] = true;
            }
        }
        dp = dp_stk;
    }

    int cnt = 0;
    REP(i, 1 << 14)
        if (dp[i]) cnt++;

    cout << cnt << endl;
}