Buggy python submission (verdict: Runtime Error):
N = int(input())
list = []*(N+1)

M =int((N-2)**0.5)
for x in range(1,M+1):
    for y in range(1,M+1):
        for z in range(1,M+1):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                list[p] = list[p] + 1
for i in range(1,N+1):
    print(list[i])

Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

N = int(input())
for n in range(1,N+1):
    if n < 6:
        print(0)
    else:
        #M =int((n-2)**0.5)
        count = 0
        for x in range(1,101):
            for y in range(1,x+1):
                for z in range(1,y+1):
                    if (x+y)*(x+z)+y**2+z**2 == n:
                        if x == y == z:
                            count = 1
                        elif x == y or y == z:
                            count = 3
                        else:
                            count = 6
                        #p=[x,y,z]
                        #q=[]
                        #for p in itertools.permutations(p):
                            #q.append(p)
                            #count = len(set(q))
                    else:
                        pass
        print(count)



Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

N = int(input())
for n in range(1,N+1):
    if n < 6:
        print(0)
    else:
        M =int((n-2)**0.5)
        count = 0
        for x in range(1,M+1):
            for y in range(1,x+1):
                for z in range(1,y+1):
                    if (x+y)*(x+z)+y**2+z**2 == n:
                        if x == y == z:
                            count = 1
                        elif x == y or y == z:
                            count = 3
                        else:
                            count = 6
                        #p=[x,y,z]
                        #q=[]
                        #for p in itertools.permutations(p):
                            #q.append(p)
                            #count = len(set(q))
                    else:
                        pass
        print(count)



Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

N = int(input())
for n in range(1,N+1):
    if n < 6:
        print(0)
    else:
        M =int((n-2)**0.5)
        count = 0
        for x in range(1,M+1):
            for y in range(1,x+1):
                for z in range(1,y+1):
                    if (x+y)*(x+z)+y**2+z**2 == n:
                        p=[x,y,z]
                        q=[]
                        for p in itertools.permutations(p):
                            q.append(p)
                            count = len(set(q))
                    else:
                        pass
        print(count)



Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

N = int(input())
for n in range(1,N+1):
    if n < 6:
        print(0)
    else:
        M =int((n-2)**0.5)
        count = 0
        for x in range(1,M+1):
            for y in range(1,x+1):
                for z in range(1,y+1):
                    if (x+y)*(x+z)+y**2+z**2 == n:
                        p=[x,y,z]
                        q=[]
                        for p in itertools.permutations(p):
                            q.append(p)
                            count = len(set(q))
                    else:
                        pass
        print(count)



Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

N = int(input())
for n in range(1,N+1):
    if n < 6:
        print(0)
    else:
        M =int((n-2)**0.5)
        count = 0
        for x in range(1,M+1):
            for y in range(1,x+1):
                for z in range(1,y+1):
                    if (x+y)*(x+z)+y**2+z**2 == n:
                        p=[x,y,z]
                        q=[]
                        for p in itertools.permutations(p):
                            q.append(p)
                            count = len(set(q))
                    else:
                        pass
        print(count)



Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
for n in range(1,N+1):
    if n < 6:
        print(0)
    else:
        M =int((n-2)**0.5)
        count = 0
        for x in range(1,M+1):
            for y in range(1,M+1):
                for z in range(1,M+1):
                    if (x+y)*(x+z)+y**2+z**2 == n:
                        count = count + 1
                    else:
                        pass
        print(count)

Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
for n in range(1,N+1):
    if n < 6:
        print(0)
    else:
        M =int((n-2)**0.5)
        count = 0
        for x in range(1,M+1):
            for y in range(1,M+1):
                for z in range(1,M+1):
                    if x**2+y**2+z**2+x*y+y*z+z*x == n:
                        count = count + 1
                    else:
                        pass
        print(count)


Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())



for n in range(1,N+1):
    if n < 6:
        print(0)
    else:
        M =int((n-2)**0.5)
        count = 0
        for x in range(1,M+1):
            #P=x**2+y**2+z**2+x*y+y*z+z*x
            for y in range(1,M+1):
                #Q=x**2+y**2+z**2+x*y+y*z+z*x
                for z in range(1,M+1):
                    #R = x**2+y**2+z**2+x*y+y*z+z*x
                    if x**2+y**2+z**2+x*y+y*z+z*x == n:
                        count = count + 1
                    else:
                        pass
        print(count)



Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())


for n in range(1,N+1):
    if n < 3:
        print(0)
    else:
        M =int((n-2)**0.5)
        count = 0
        for x in range(1,M+1):
            #P=x**2+y**2+z**2+x*y+y*z+z*x
            for y in range(1,M+1):
                #Q=x**2+y**2+z**2+x*y+y*z+z*x
                for z in range(1,M+1):
                    #R = x**2+y**2+z**2+x*y+y*z+z*x
                    if x**2+y**2+z**2+x*y+y*z+z*x == n:
                        count = count + 1
                    else:
                        pass
        print(count)



Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

M = N//6 #x,y,zがとりうる最大の値を計測
#print(M)

for n in range(1,N+1):
	count = 0
	for x in range(1,M+1):
		#P=x**2+y**2+z**2+x*y+y*z+z*x
		for y in range(1,M+1):
			#Q=x**2+y**2+z**2+x*y+y*z+z*x
			for z in range(1,M+1):
				#R = x**2+y**2+z**2+x*y+y*z+z*x
				if x**2+y**2+z**2+x*y+y*z+z*x == n:
					count = count + 1
				else:
					pass

	print(count)		


Fixed submission:
N = int(input())
lst = [0]*(N+1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            p = (x+y)*(x+z)+y**2+z**2
            if p > N:
                break
            else:
                lst[p] += 1
for i in range(1,N+1):
    print(lst[i])