#include <bits/stdc++.h>
using namespace std;

int power(int64_t n, int k, int m) {
    if (k == 0) return 1;
    int64_t res = power(n * n % m, k / 2, m);
    if (k % 2) res = res * n % m;
    return res;
}

int totient(int n) {
    int res = 1;
    for (int i = 2; i * i <= n; i++) {
        if (n % i) continue;
        res *= i - 1;
        n /= i;
        while (n % i == 0) {
            res *= i;
            n /= i;
        }
    }
    if (n > 1) {
        res *= n - 1;
    }
    return res;
}

int solve(int n) {
    if (n == 1) return 1;
    int t = totient(n), period = t;
    for (int i = 1; i * i <= t; i++) {
        if (power(2, i, n) == 1) return i;
        if (power(2, t / i, n) == 1) period = t / i;
    }
    return period;
}

int main() {
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        int n;
        cin >> n;
        cout << solve(2 * n - 1) << endl;
    }
}