#include #include #include using namespace std; int main() { int n; cin >> n; vector a(n); for (int i = 0; i < n; ++i) cin >> a[i]; sort(a.begin(), a.end()); vector ansb(n - 1, -1), ans(n, -1); int ma = -1, id = -1; for (int i = 0; i < n; ++i) { auto b = a; vector tmp; tmp.push_back(b[i]); b.erase(b.begin() + i); while (!b.empty()) { int ma = -1, id = -1; for (int j = 0; j < b.size(); ++j) { int tv = tmp.back() ^ b[j]; if (tv >= ma) { ma = tv; id = j; } } tmp.push_back(b[id]); b.erase(b.begin() + id); } vector tmpb(n - 1); for (int i = 0; i < n - 1; ++i) tmpb[i] = tmp[i] ^ tmp[i + 1]; if (ansb < tmpb) { ansb = tmpb; ans = tmp; } else if (ansb == tmpb && ans < tmp) ans = tmp; } for (int i = 0; i < n; ++i) cout << ans[i] << " \n"[i == n - 1]; }