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).
N = int(input())

ans = [0] * 10000

for i in range(1, 200):
    for j in range(1, 200):
        for k in range(1, 200):
            z = i**2 + j**2 + k**2 + i*j + j*k + k*i
            if z < 10000:
                ans[z] += 1

for x in range(1, N+1):
    print(ans[x])

from numba import jit

N = int(input())

@jit
def f():
    ret = [0] * 10001

    for i in range(1, 200):
        for j in range(1, 200):
            for k in range(1, 200):
                z = i**2 + j**2 + k**2 + i*j + j*k + k*i
                if z < 10001:
                    ret[z] += 1

    return ret


ans = f()

for x in range(1, N+1):
    print(ans[x])
