Let f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:    * 1 \leq x,y,z   * x^2 + y^2 + z^2 + xy + yz + zx = n  Given an integer N, find each of f(1),f(2),f(3),\ldots,f(N).
num_limit = int(input())
s_limit = int(num_limit**0.5)
for i in range(1,num_limit+1):
    xyz_list = []
    if i >=1 and i <= 5:
        print(0)
    else:
        s_limit = int(i ** 0.5)
        for j in range(1,s_limit+1):
            for k in range(1,s_limit+1):
                for l in range(1,s_limit+1):
                    if i == j**2 + k**2 + l**2 + j*k + k*l + l*j:
                        xyz_list.append([i,j,k])
    print(len(xyz_list))
num_limit = int(input())
num_list = [0] * num_limit
j_limit = int(num_limit ** 0.5)
for j in range(1,j_limit+1):
    for k in range(1,j + 1):
        if num_limit < j**2 + k**2 + j*k:
            break
        for l in range(1,k+1):
            if num_limit < j**2 + k**2 + l**2 + j*k + k*l + l*j:
                break
            elif num_limit >= j**2 + k**2 + l**2 + j*k + k*l + l*j:
                if j > k:
                    if k > l:
                        num_list[j**2 + k**2 + l**2 + j*k + k*l + l*j-1] += 6
                    else:
                        num_list[j**2 + k**2 + l**2 + j*k + k*l + l*j-1] += 3
                elif k > l:
                    num_list[j**2 + k**2 + l**2 + j*k + k*l + l*j-1] += 3
                else:
                    num_list[j**2 + k**2 + l**2 + j*k + k*l + l*j-1] += 1
for i in num_list:
    print(i)