from math import *

def Sum(n):
    return n * (n + 1) // 2

def P(n):
    if (n <= 0):
        return 0
    a = (isqrt(8 * n + 9) - 1) // 2 - 1
    while True:
        b = n - (Sum(a) - 1)
        if (1 <= a and 1 <= b and b <= a+1):
            return a
        a += 1

M = 3 * 10**5
qs = [0 for i in range(M + 1)]
rs = [0 for i in range(M + 1)]
ss = [0 for i in range(M + 1)]
ts = [0 for i in range(M + 1)]
qs[1] = 1
for i in range(2, M + 1):
    qs[i] = qs[i - 1] + qs[P(i)]
for i in range(1, M + 1):
    rs[i] = rs[i - 1] + (1 + i) * qs[i]
    ss[i] = ss[i - 1] + ((1 + i) * (-24 + 14*i + 19*i**2 + 12*i**3 + 3*i**4) // -24) * qs[i]
    ts[i] = ts[i - 1] + ((1 + i) * (107520 - 73344*i - 99136*i**2 - 52904*i**3 + 18324*i**4 + 58690*i**5 + 63635*i**6 + 47320*i**7 + 25025*i**8 + 9450*i**9 + 2485*i**10 + 420*i**11 + 35*i**12) // 107520) * qs[i]

def T(n):
    if (n <= 0):
        return 0
    # print("T", n)
    if (n <= M):
        return ts[n]
    raise Exception

def S(n):
    if (n <= 0):
        return 0
    if (n <= M):
        return ss[n]
    a = P(n)
    u = Sum(a) - 1
    b = n - u
    # print("S", n, a, b)
    return T(a - 1) + (n*(3+n)*(-2+3*n+n**2)*(8+3*n+n**2)//-48) * R(a - 1) + (b * (1+b) * (-1024 + 30*b**5 + 280*u + 2170*u**2 + 1785*u**3 + 700*u**4 + 105*u**5 + 25*b**4 * (10 + 7*u) + 2*b**3 * (407 + 595*u + 210*u**2) + b**2 * (1286 + 2975*u + 2205*u**2 + 525*u**3) + b * (324 + 3220*u + 3815*u**2 + 1925*u**3 + 350*u**4)) // -1680) * Q(a)

def R(n):
    if (n <= 0):
        return 0
    if (n <= M):
        return rs[n]
    a = P(n)
    u = Sum(a) - 1
    b = n - u
    # print("R", n, a, b)
    return S(a - 1) + (n*(3+n)//2) * R(a - 1) + (b*(1+b)*(4+2*b+3*u)//6) * Q(a)

def Q(n):
    if (n <= 0):
        return 0
    if (n <= M):
        return qs[n]
    a = P(n)
    u = Sum(a) - 1
    b = n - u
    # print("Q", n, a, b)
    return R(a - 1) + b * Q(a)

# for n in range(22):
    # print(n, P(n), Q(n), R(n))

numCases = int(input())
for caseId in range(numCases):
    N = int(input())
    print(Q(N))