#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;

int N;
set<int> st{0};
int main(){
    cin>>N;
    REP(i,0,N){
        int a;
        cin>>a;
        int n = st.size();
        set<int> tmp = st;
        for(auto itr = tmp.begin(); itr!=tmp.end(); ++itr){
            st.insert(a^*itr);
        }
    }
    p(st.size());

    return 0;
}