#include<cstdio>

#include<iostream>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<cctype>

#include<cstdlib>

#include<vector>

#include<queue>

#include<map>

#include<set>

#define ll long long

#define R register int

using namespace std;

namespace Fread {

    static char B[<<],*S=B,*D=B;

    #define getchar() (S==D&&(D=(S=B)+fread(B,1,1<<15,stdin),S==D)?EOF:*S++)

    inline int g() {

        R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;

        do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;

    } inline bool isempty(const char& ch) {return ch<=||ch>=;}

    inline void gs(char* s) {register char ch; while(isempty(ch=getchar())); do *s++=ch; while(!isempty(ch=getchar()));}

}using Fread::g; using Fread::gs;

const int N=;

int t[N*][],tot,n,a[N],s[N],b[N],f[N],ans;

inline void ins(int x) { R now=;

    for(R i=;~i;--i) {

        R ch=(x>>i)&;

        if(!t[now][ch]) t[now][ch]=++tot;

        now=t[now][ch];

    }

}

inline int query(int x) { R now=,ret=;

    for(R i=;~i;--i) {

        R ch=(x>>i)&;

        if(!t[now][ch^]) now=t[now][ch^];

        else now=t[now][ch^],ret+=(<<i);

    } return ret;

}

signed main() {

#ifdef JACK

    freopen("NOIPAK++.in","r",stdin);

#endif

    n=g(); for(R i=;i<=n;++i) a[i]=g();

    for(R i=;i<=n;++i) s[i]=s[i-]^a[i];

    for(R i=n;i;--i) b[i]=b[i+]^a[i]; ins();

    for(R i=;i<=n;++i) f[i]=max(f[i-],query(s[i])),ins(s[i]);

    memset(t,,sizeof(t)); tot=; ins();

    for(R i=n;i;--i) ans=max(ans,f[i-]+query(b[i])),ins(b[i]);

    printf("%d\n",ans);

}