#include #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; using ll = long long; const ll mod = 998244353; #define fi first #define se second #define rep(i,n) for(ll i=0;i> N; vector A(N); rep(i,N) cin >> A[i]; vector ans(N,-1); rep(i,N){ vector cnt(N,-1); cnt[0]=A[i]; vector used(N,false); used[i]=true; rep(j,N){ if(j==0) continue; rep(k,N){ if(used[k]) continue; if(cnt[j]==-1){ cnt[j]=A[k]; continue; } if((cnt[j-1]^cnt[j])<(cnt[j-1]^A[k])){ cnt[j]=A[k]; } } rep(k,N){ if(used[k]) continue; if(cnt[j]==A[k]){ used[k]=true; break; } } } if(i==0) ans=cnt; ll flag=-1; rep(i,N-1){ if((ans[i]^ans[i+1])<(cnt[i]^cnt[i+1])){ flag=1; ans=cnt; break; } if((ans[i]^ans[i+1])>(cnt[i]^cnt[i+1])){ flag=0; break; } } if(flag==-1){ if(ans[0]