xx

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
//#include<math.h>
#include<queue>
#include<algorithm>
#include<iostream>
#include<bitset>
using namespace std;

bool isdigit(char c) {return c>='0' && c<='9';}
int qread()
{
    char c;int s=0,t=1;while (!isdigit(c=getchar())) (c=='-' && (t=-1));
    do s=s*10+c-'0'; while (isdigit(c=getchar())); return s*t;
}

const int N = 1005, Bit = 30;
bitset<N> S[N]; int n, f[N], v[N], g[N]; bool vis[N];
inline void insert(int x) { 
    dow(i,Bit,0) { 
        if( (v[x] >> i) & 1 ) { 
            if( f[i] ) { 
                v[x] ^= v[f[i]];
                S[x] ^= S[f[i]]; 
            } else { 
                f[i] = x;
                vis[x] = 1;
            }
        }
    }
} 
inline void upd(int a,int b) {
    int id = 0, pos; 
    rep(i,1,n) if( !vis[i] && S[i][a] ) { id = i; break; }
    if( id ) { 
        rep(i,1,n) if( S[i][a] && i != id ) S[i] ^= S[id], v[i] ^= v[id];
        v[id] = v[id] ^ g[a] ^ b, g[a] = b;
        insert(id);
    } else { 
        rep(i,0,Bit) if( f[i] && S[i][a] ) { id = i; break; }
        pos = id, id = f[id], f[pos] = vis[id] = 0;
        rep(i,1,n) if( S[i][a] && i != id ) S[i] ^= S[id], v[i] ^= v[id];
        v[id] = v[id] ^ g[a] ^ b, g[a] = b;
        insert(id);
    } 
}

int main() { 
    int n = read();
    rep(i,1,n) vis[i] = 0, g[i] = v[i] = read(), S[i][i] = 1, insert(i);
}