Problem: p02608
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
from collections import defaultdict,deque
from sys import stdin,setrecursionlimit
import heapq,bisect,math,itertools,string,queue,copy
setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, stdin.readline().split()))

N = int(input())

d = [0]*(10**6 + 1)

for x in range(101):
    for y in range(101):
        for z in range(101):
            res = x**2 + y**2 + z**2 + x*y + y*z + z*x
            d[res] += 1

for i in range(1,N+1):
    print(d[i])


Failing test case input:
743

Expected output:
0
0
0
0
0
1
0
0
0
0
3
0
0
0
0
0
3
3
0
0
0
0
0
1
6
0
3
0
0
0
0
0
3
3
6
0
0
3
0
0
0
0
3
3
6
0
6
0
0
0
3
0
0
1
6
0
6
6
0
0
6
0
0
0
0
3
3
3
6
0
6
3
6
0
0
0
6
0
0
0
3
3
9
0
6
3
6
0
3
6
0
0
0
0
6
1
6
0
6
6
0
3
12
0
6
0
0
3
6
0
0
0
3
3
12
0
6
3
6
0
3
6
9
0
6
0
0
0
3
6
3
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
6
0
0
1
6
3
12
6
0
0
12
0
6
0
6
6
12
0
0
6
0
0
6
0
12
3
6
0
6
3
9
6
3
6
6
0
6
0
6
0
15
6
0
0
6
0
3
3
12
0
12
6
6
0
3
6
6
3
12
0
6
0
9
6
0
0
6
3
12
1
6
6
6
6
0
0
18
0
12
0
3
6
12
0
0
6
3
6
12
0
12
0
0
0
9
3
9
6
12
3
12
0
3
6
6
0
12
0
12
0
9
9
0
0
6
3
6
3
12
6
9
3
6
0
12
3
6
3
9
6
12
6
6
0
6
0
9
6
6
0
12
3
6
0
9
6
6
1
6
0
21
12
6
0
12
0
12
0
0
6
15
6
0
6
12
0
12
0
12
0
0
0
12
0
12
12
3
3
18
3
6
3
6
6
9
9
18
0
6
0
12
0
9
6
0
3
12
3
6
6
12
6
6
0
0
0
15
3
18
3
18
3
12
6
3
6
9
0
12
0
12
0
18
12
0
0
12
3
6
0
6
6
9
6
0
0
18
1
18
3
12
6
6
6
12
0
15
6
12
6
18
0
0
6
0
9
12
0
18
0
6
3
12
0
12
12
0
0
12
0
3
6
12
6
18
9
18
0
9
6
18
0
6
0
6
3
27
6
6
6
6
3
6
0
12
6
9
0
6
0
18
0
9
9
15
3
12
6
6
3
9
6
12
12
18
0
18
0
6
6
21
6
0
0
6
3
15
6
12
6
18
0
0
0
12
6
6
3
6
4
18
6
12
6
3
9
30
0
18
0
6
6
12
6
6
9
12
0
18
6
18
0
6
0
12
0
6
12
6
3
18
0
6
6
6
6
15
3
24
0
6
3
18
0
12
6
12
6
24
0
15
18
9
6
0
0
18
3
6
0
15
12
12
6
6
0
18
0
6
3
12
0
12
6
6
9
9
6
24
3
24
0
9
12
6
6
12
0
12
0
21
9
15
6
12
3
18
3
12
6
12
6
0
0
12
0
12
6
24
0
6
12
6
1
9
6
12
6
24
0
18
3
12
6
6
12
24
0
12
6
15
6
18
0
18
0
0
0
18
9
21
12
0
6
18
0
9
6
6
6
12
0
12
0
9
9
27
6
6
3
18
6
21
6
6
12
12
0
12
0
24
12
0
0
24
3
24
6
12
12
18
0
0
0
12
0
18
3
15
6
12
9
6
0
15
6
9
12
24
0
12
3
6
6
21
6
18
3
18
0
21
12
15
6
6
0
12
3
12
9
18
9
12
6
6
6
24
0
18
3
24
0
6
6
0
6
9
6
6
4
30
0
18
12
9
6
24
0
18
0
9
12
21
6
6
12
12


Actual output:
3
0
3
3
0
1
6
0
3
0
3
3
6
0
0
3
3
3
6
0
6
0
0
1
9
0
6
6
0
0
6
0
3
3
6
3
6
3
6
0
0
0
9
3
6
0
6
3
9
0
3
6
0
1
6
0
12
6
0
0
12
0
6
3
0
3
9
3
6
0
6
3
12
0
3
6
6
0
6
0
6
3
9
6
6
3
6
0
3
6
12
0
6
0
6
1
12
0
6
9
0
3
18
0
6
0
0
6
12
0
6
6
3
3
12
0
12
3
6
0
6
6
9
6
6
0
6
0
9
6
3
3
18
0
6
3
12
0
9
6
6
0
6
3
6
3
15
6
0
1
12
3
12
6
0
6
18
0
6
0
6
6
18
0
0
6
0
0
15
0
18
9
6
0
12
3
9
6
3
6
12
0
12
0
6
0
15
6
6
0
6
3
9
3
12
9
12
6
12
0
9
6
6
3
12
0
6
6
9
6
6
0
6
3
12
1
18
6
12
6
0
0
24
0
15
0
3
12
18
0
0
6
3
6
12
0
18
0
0
0
15
3
12
12
12
3
24
0
3
6
6
6
12
0
12
3
9
9
12
0
6
3
6
3
12
6
9
9
6
0
18
3
18
3
9
6
18
6
12
0
6
0
15
6
6
0
12
3
9
0
15
12
6
1
6
0
21
12
6
3
24
0
12
6
0
6
21
6
6
6
12
0
18
0
12
6
0
0
12
0
12
12
3
6
24
3
12
3
6
6
15
9
24
0
6
6
18
0
9
6
0
3
24
3
6
6
12
6
12
0
6
0
15
3
18
3
18
3
12
6
12
6
12
12
12
0
18
0
18
12
0
6
18
3
6
0
6
6
15
6
6
0
18
1
18
3
18
12
6
6
12
0
15
6
12
6
24
0
12
9
0
9
24
0
18
0
6
3
18
0
12
18
0
0
12
0
9
6
12
6
24
9
18
0
9
6
30
0
6
0
6
6
33
6
6
12
6
3
12
0
21
6
9
6
6
0
18
6
9
9
15
3
18
6
6
3
15
6
12
12
18
0
24
0
6
6
21
12
12
0
12
3
15
6
18
6
18
0
0
0
24
6
6
6
6
4
24
6
18
6
3
9
30
0
18
6
6
6
18
6
6
9
12
0
18
6
27
6
6
0
24
0
12
12
6
9
18
0
6
6
6
6
21
3
30
0
6
3
21
0
12
18
12
6
24
0
15
18
9
6
6
0
24
3
6
0
21
12
18
6
6
0
30
0
6
9
12
0
24
6
6
9
9
6
24
3
30
0
9
12
12
6
12
0
12
3
27
9
21
6
12
3
18
3
12
6
12
15
12
0
12
6
12
6
24
0
12
12
6
1
15
6
18
12
24
0
24
3
12
6
6
12
30
0
12
6
15
6
24
0
18
0
0
6
21
9
21
18
0
6
24
0
15
6
6
6
30
0
12
0
9
9
33
6
6
3
18
6
21
6
18
18
12
0
12
0
30
12
0
0
30
3
24
6
12
12
18
0
6
0
12
0
24
3
18
15
12
9
18
0
15
6
9
18
24
0
18
9
6
6
27
6
18
3
18
0
21
12
15
12
6
0
24
3
12
9
18
9
18
6
12
6
24
0
18
3
24
0
6
6
12
6
15
12
6
4
36
0
21
12
9
12
30
0
18
0
9
12
27
6
18
12
12


Fixed submission (verdict: Accepted):
from collections import defaultdict,deque
from sys import stdin,setrecursionlimit
import heapq,bisect,math,itertools,string,queue,copy
setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, stdin.readline().split()))

N = int(input())

d = [0]*(10**6 + 1)

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            res = x**2 + y**2 + z**2 + x*y + y*z + z*x
            d[res] += 1

for i in range(1,N+1):
    print(d[i])