#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
long double PI = 3.1415926535897932384626433832;
const double E = 0.0000001;
const int INF = 1e7;
int gcd(int a, int b) {
  if (a == 0 || b == 0) {
    return a + b;
  } else {
    if (a > b) {
      return gcd(b, a % b);
    } else {
      return gcd(a, b % a);
    }
  }
}
signed main() {
  cin.tie(0), ios_base::sync_with_stdio(false);
  ;
  int q;
  cin >> q;
  unordered_map<int, int> S;
  S[33554431] = 1082401;
  S[16777215] = 5592405;
  S[8388607] = 178481;
  S[4194303] = 1398101;
  S[2097151] = 299593;
  S[1048575] = 349525;
  S[524287] = 1;
  S[262143] = 87381;
  S[131071] = 1;
  S[65535] = 21845;
  S[32767] = 4681;
  S[16383] = 5461;
  for (int i = 0; i < q; ++i) {
    int a;
    cin >> a;
    int b = 2;
    while (b <= a) {
      b = b * 2;
    }
    if (b - 1 == a) {
      if (S.find(a) == S.end()) {
        int ma = 1;
        for (int j = 1; j < a; ++j) {
          ma = max(ma, gcd((a & j), (a ^ j)));
        }
        S[a] = ma;
      }
      cout << S[a] << "\n";
    } else {
      cout << b - 1 << "\n";
    }
  }
  return 0;
}
