#include <algorithm> #include <atcoder/scc> #include <iostream> #include <vector> using namespace std; using i64 = long long; constexpr int V = 1 << 20; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n; cin >> n; vector<int> A(n); atcoder::scc_graph graph(V + n); for (auto& a : A) cin >> a; for (int i = 1; i < V; ++i) { for (int cur = i; cur > 0; cur -= cur & -cur) graph.add_edge(i, i ^ (cur & -cur)); } for (int i = 0; i < n; ++i) { graph.add_edge(i + V, V - 1 - A[i]); graph.add_edge(V - 1 - A[i], i + V); graph.add_edge(A[i], i + V); } vector<int> ans(n); for (const auto& group : graph.scc()) { vector<int> pos, cur; pos.reserve(group.size()); cur.reserve(group.size()); for (auto i : group) { if (i < V) continue; else i -= V; cur.push_back(A[i]); pos.push_back(i); } sort(cur.begin(), cur.end()); for (int i = 0, m = pos.size(); i < m; ++i) ans[pos[i]] = cur[i]; } for (auto a : ans) cout << a << ' '; return 0; }