//Code by Patcas Csaba #include <vector> #include <string> #include <set> #include <map> #include <queue> #include <bitset> #include <stack> #include <list> #include <numeric> #include <algorithm> #include <cstdio> #include <fstream> #include <iostream> #include <sstream> #include <iomanip> #include <cctype> #include <cmath> #include <ctime> #include <cassert> using namespace std; #define LL long long #define PII pair <int, int> #define VB vector <bool> #define VI vector <int> #define VD vector <double> #define VS vector <string> #define VPII vector <pair <int, int> > #define VVI vector < VI > #define VVB vector < VB > #define FORN(i, n) for(int i = 0; i < (n); ++i) #define FOR(i, a, b) for(int i = (a); i <= (b); ++i) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define REPEAT do{ #define UNTIL(x) }while(!(x)); #define SZ size() #define BG begin() #define EN end() #define CL clear() #define X first #define Y second #define RS resize #define PB push_back #define MP make_pair #define ALL(x) x.begin(), x.end() #define IN_FILE "a.in" #define OUT_FILE "a.out" int n; int main() { //Read data //freopen(IN_FILE, "r", stdin); //freopen(OUT_FILE, "w", stdout); cin >> n; FOR(i, 1, n) { int x; cin >> x; int seen1 = -1, seen0 = -1; FORD(j, 31, 0) if ((x & (1 << j)) != 0) { seen1 = j; if (seen0 != -1) { x = x & (x - 1); x += 1 << seen0; break; } } else if (seen1 != -1) if (seen0 == -1) seen0 = j; cout << x << " "; } //Solve //Write data return 0; }