# https://www.codechef.com/problems/COUNT0110

# pattern generator
def f(x):
    possible = set()
    for mask in range(1 << x):
        s = bin(mask)[2:].zfill(x)
        total = [0, 0]
        for i in range(x):
            for j in range(i + 1, x):
                if s[i] == "0" and s[j] == "1":
                    total[0] += 1
                elif s[i] == "1" and s[j] == "0":
                    total[1] += 1
        possible.add(tuple(total))
    return len(possible)


# for i in range(1, 25):
#     print(f(i))

# [1, 4, 13, 32, 65, 116, 189, 288, 417, 580, 781][3, 10, 26, 55, 101, 168, 260, 381, 535, 726]

from fractions import Fraction


def solve():
    n = int(input())
    if n % 2 == 1:  # https://oeis.org/search?q=1%2C+4%2C+13%2C+32%2C+65%2C+116%2C+189%2C+288%2C+417%2C+580%2C+781&go=Search
        n //= 2
        n += 1
        print(n * (2 * n ** 2 - 3 * n + 4) // 3)
    else:  # https://oeis.org/search?q=3%2C+10%2C+26%2C+55%2C+101%2C+168%2C+260%2C+381%2C+535%2C+726&go=Search
        # val = 1 + (5 / 6) * n + (1 / 2) * n ** 2 + (2 / 3) * n ** 3
        n //= 2
        val = 1 + Fraction(5, 6) * n + Fraction(1, 2) * n ** 2 + Fraction(2, 3) * n ** 3
        assert val.denominator == 1
        print(val.numerator)


t = int(input())
for _ in range(t):
    solve()