#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define int ll
using pii = pair<int, int>;
template<typename T> using minHeap = priority_queue<T, vector<T>, greater<T>>;
#define all(x) x.begin(),x.end()
#define V vector
#define size(v) (int(v.size()))
const ll mxn= 1e6+3, inf= 1.5e18,mod= 1e9+7;//998244353;
// iwkms
vector<ll> primes{2};
bitset<mxn> ok(0);
int ans[mxn];
void pre() {
    for(ll i=3,j;i<mxn;i+=2)
        if(!ok[i]) {
            primes.push_back(i);
            for(j=i*i;j<mxn;j+=(i<<1)) ok[j]=1;
        }
    ans[1]=1;
    int pre = 1;
    for (int i=2;i<mxn;i++) {
        pre += i;
        int nm = pre, d = 1;
        for (int& p : primes) if (p*p > nm) break; else if (nm % p) continue; else {
            int e =1;while (nm%p==0) e++, nm /= p;
            d*= e;
        }
        if (nm>1) d *= 2;
        ans[i] = d;
        ans[i]=max(ans[i], ans[i-1]);
    }
}

void solve() {
    int n;cin>>n;
    cout<<ans[n]<<"\n";
}
int32_t main() 
{
    pre();
    cin.tie(0)->sync_with_stdio(0);
    int t=1;cin>>t;while(t--)
        solve();
    return 0;
}