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

// #define int        long long int
#define pb         push_back
#define all(x)     x.begin(),x.end()
#define allr(x)    x.rbegin(),x.rend()
#define ii         pair<int,int>
#define endl       '\n'

const int N = 1e6 + 1;
vector<int> divisors(N, 0), maxDiv(N);

long long numberOfDivisors(long long num) {
    long long total = 1;
    for (int i = 2; (long long)i * i <= num; i++) {
        if (num % i == 0) {
            int e = 0;
            do {
                e++;
                num /= i;
            } while (num % i == 0);
            total *= e + 1;
        }
    }
    if (num > 1) {
        total *= 2;
    }
    return total;
}
// TC -> O(rootN)
// for optimize
//      factorize with pollardRho, then
//      (e1 + 1) * (e2 + 1) * ... 
// e1 = p1 ^ e1

void pipra(int tc) {
    int n;
    cin >> n;
    cout << maxDiv[n] << endl;
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int num = 1, mx = 0;
    for(int i = 1 ; i <= N ; i++) {
        divisors[i] = numberOfDivisors((i * (i + 1)) >> 1);
        if(mx < divisors[i]) {
            mx = divisors[i];
            num = i;
        }
        maxDiv[i] = num;
    }
    // cout << endl;

    int t = 1;
    cin >> t;
    for(int i = 1 ; i <= t ; i++)
        pipra(i);
    return 0;
}