线性基

 

 

 

 

 

 

 

 

#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline ll re_ad() {
    char ch=getchar(); ll x=0,f=1;
    while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while('0'<=ch && ch<='9') x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
    return x*f;
}

const ll N=111,St=50;
ll n,a[N],p[N];

int main()
{
    n=re_ad();
    for(ll i=1;i<=n;++i) a[i]=re_ad();
    for(ll i=1,x=a[i];i<=n;++i,x=a[i]) {
        for(ll j=St;j>=0;--j) if((x>>j)&1) {
            if(!p[j]) { p[j]=x; break; }
            else x^=p[j];
        }
    }
    ll ans=0;
    for(ll j=50;j>=0;--j) if((ans^p[j])>ans) ans^=p[j];
    printf("%lld\n",ans);
    return 0;
}