#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000 * 1000;
map<int, int> has;
set<int> twos;
int gcd(int a, int b) {
  while (a != 0) {
    int c = b % a;
    b = a;
    a = c;
  }
  return b;
}
int main(int argc, const char* argv[]) {
  has[3] = 1;
  has[7] = 1;
  has[15] = 5;
  has[31] = 1;
  has[63] = 21;
  has[127] = 1;
  has[255] = 85;
  has[511] = 73;
  has[1023] = 341;
  has[2047] = 89;
  has[4095] = 1365;
  has[8191] = 1;
  has[16383] = 5461;
  has[32767] = 4681;
  has[65535] = 21845;
  has[131071] = 1;
  has[262143] = 87381;
  has[524287] = 1;
  has[1048575] = 349525;
  has[2097151] = 299593;
  has[4194303] = 1398101;
  has[8388607] = 178481;
  has[16777215] = 5592405;
  has[33554431] = 1082401;
  for (int i = 0; i < 30; i++) {
    twos.insert(1 << i);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int x;
    cin >> x;
    if (has.count(x)) {
      cout << has[x] << "\n";
      continue;
    }
    if (twos.count(x + 1)) {
      int ans = 1;
      for (int j = 1; j < x; j++) {
        ans = max(ans, gcd(x ^ j, x & j));
      }
      cout << ans << "\n";
      has[x] = ans;
    } else {
      int ans = 1;
      while (ans <= x) {
        ans *= 2;
      }
      cout << ans - 1 << "\n";
    }
  }
  return 0;
}
