// https://github.com/potato167/po167_library #include #include using namespace std; using ll=long long; const ll ILL=2167167167167167167; const int INF=2100000000; #define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++) #define all(p) p.begin(),p.end() template using pq_ = priority_queue, greater>; template int LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template int UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,T b){if(b bool chmax(T &a,T b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;} template void vec_out(vector &p,int ty=0){ if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'< T vec_min(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template T vec_max(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} template T vec_sum(vector &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;} int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;} template T square(T a){return a * a;} void solve(); // DEAR MYSTERIES / TOMOO int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; // cin >> t; rep(i, 0, t) solve(); } void solve(){ int N; cin >> N; vector A(N); rep(i, 0, N) cin >> A[i]; int c = 0; rep(i, 0, N) rep(j, 0, N) if (i != j){ chmax(c, A[i] ^ A[j]); } vector ans; set> s; rep(i, 0, N) rep(j, 0, N) if (i != j && c == (A[i] ^ A[j])) { pair tmp = {A[i], A[j]}; if (!s.insert(tmp).second) continue; vector C = {A[i], A[j]}; vector use(N); use[i] = 1, use[j] = 1; vector B = {A[i] ^ A[j]}; rep(k, 2, N) { int ind = 0, val = -1; rep(a, 0, N) if (use[a] == 0) { if (chmax(val, C.back() ^ A[a])) { ind = a; } } B.push_back(C.back() ^ A[ind]); C.push_back(A[ind]); use[ind] = 1; } for (auto x : C) B.push_back(x); chmax(ans, B); } rep(i, 0, N) { cout << ans[i + N - 1] << (i == N - 1 ? "\n" : " "); } }