A. Anu Has a Function
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #include <cstdio> #include <cstring> #include <numeric> #include <cmath> #include <iomanip> #include <deque> #include <bitset> #define ll long long #define PII pair<int, int> #define rep(i,a,b) for(int i=a;i<=b;i++) #define dec(i,a,b) for(int i=a;i>=b;i--) #define pb push_back #define mk make_pair using namespace std; int dir[4][2] = { { 0,1 } ,{ 0,-1 },{ 1,0 },{ -1,0 } }; const long long INF = 0x7f7f7f7f7f7f7f7f; const int inf = 0x3f3f3f3f; const double pi = 3.14159265358979323846; const int mod = 998244353; const int N = 2e5 + 5; //if(x<0 || x>=r || y<0 || y>=c) inline ll read() { ll x = 0; bool f = true; char c = getchar(); while (c < '0' || c > '9') { if (c == '-') f = false; c = getchar(); } while (c >= '0' && c <= '9') x = (x << 1) + (x << 3) + (c ^ 48), c = getchar(); return f ? x : -x; } ll gcd(ll m, ll n) { return n == 0 ? m : gcd(n, m % n); } ll lcm(ll m, ll n) { return m * n / gcd(m, n); } int main() { int n; cin >> n; vector<int> a(n+1),pre(n+1),suf(n+2); pre[0] = ~0; suf[n + 1] = ~0; rep(i, 1, n) cin >> a[i]; rep(i,1,n) { pre[i] = pre[i - 1] & (~a[i]); } dec(i, n, 1) { suf[i] = suf[i + 1] & (~a[i]); } int t0 = a[1] & suf[2]; int t1 = a[n] & pre[n - 1]; int pos=1; rep(i, 1, n-1) { if ((pre[i - 1] & a[i] & suf[i + 1]) > t0) { t0 = pre[i - 1] & a[i] & suf[i + 1]; pos = i; } } if (t1 > t0) pos = n; swap(a[1], a[pos]); rep(i, 1, n) cout << a[i] << " "; return 0; }