#include //#include using namespace std; // using namespace atcoder; // using mint = modint1000000007; // const int mod = 1000000007; // using mint = modint998244353; // const int mod = 998244353; // const int INF = 1e9; // const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i, l, r) for (int i = (l); i < (r); ++i) #define rrep(i, n) for (int i = (n)-1; i >= 0; --i) #define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define P pair template inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int n; cin >> n; vectora(n); rep(i, n)cin >> a[i]; vectorb(n - 1, -1); vectorc; rep(i, n) { auto ca = a; vectorb2, c2; c2.push_back(ca[i]); ca[i] = -1; rep(i, n - 1) { int mx = -1; int idx = -1; rep(j, n)if (ca[j] != -1 && chmax(mx, c2.back() ^ ca[j])) { idx = j; } c2.push_back(ca[idx]); b2.push_back(mx); ca[idx] = -1; } if (chmax(b, b2)) { c = c2; } } for (auto e : c)cout << e << " "; cout << endl; return 0; }