#include <iostream>
using namespace std;
int countDivisors(int n) {
    int count = 0;
    for (int i = 1; i * i <= n; ++i) {
        if (n % i == 0) {
            if (i * i == n)
                count += 1; 
            else
                count += 2; 
        }
    }
    return count;
}

int main() {
    int t;
    cin >> t; 

    while (t--) {
        int N;
        cin >> N;

        int maxDivisors = 0;

        for (int L = 1; L <= N; ++L) {
            
            int sum = (L * (L + 1)) / 2;

            int divisors = countDivisors(sum);

          
            if (divisors > maxDivisors) {
                maxDivisors = divisors;
            }
        }

        cout << maxDivisors << endl;
    }

    return 0;
}