#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pairP; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; typedef long double ld; typedef pair LDP; const ld eps = 1e-12; const ld pi = acosl(-1.0); ll mod_pow(ll x, ll n, ll m = mod) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 2; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } int gcd(int a, int b) { if (a < b)swap(a, b); while (b) { int r = a % b; a = b; b = r; } return a; } int lcd(int a, int b) { return a / (gcd(a, b)) * b; } map mp; map memo; void solve() { /*rep1(n, 100) { vector p(2 * n); rep(i, n) { p[i] = 2 * i; p[i + n] = 2 * i + 1; } vector used(2*n); int x = 1; rep(i, 2*n) { if (used[i])continue; used[i] = true; int cur = p[i]; int cnt = 1; while (cur != i) { used[cur] = true; cnt++; cur = p[cur]; } x = lcd(x, cnt); } cout << n << " " << x << "\n"; }*/ int n; cin >> n; if (mp[n]) { cout << memo[n] << "\n"; return; } mp[n] = true; int x = 2 * n - 1; vector ps; for (int i = 2; i <= 100000; i++) { if (x % i == 0) { int c = 1; while (x % i == 0) { x /= i; c *= i; } ps.push_back(c); } } if (x > 1)ps.push_back(x); int ans = 1; for (int p : ps) { ll cur = p + 1; int cnt = 0; while (cur > 1) { while ((cur & 1) == 0) { cur >>= 1; cnt++; } if (cur == 1)break; cur += p; } ans = lcd(ans, cnt); } cout << ans << "\n"; memo[n] = ans; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(15); //init_f(); //init(); //expr(); int t; cin >> t; rep(i, t) solve(); return 0; }