import sys
sys.setrecursionlimit(10**7)

n = int(input())
t = [int(input()) for i in range(n)]
#print(t)

ans = [0]*(10**6+1)
ans[3] = 4

from functools import lru_cache
@lru_cache(maxsize=10**6+1)
def dfs(x):
    if ans[x] != 0:
        return ans[x]
    ans[x] += dfs(x-1)+(x-1)*(x-2)*2
    return ans[x]

dfs(10**6)

for i in range(n):
    print(ans[t[i]])