output_description: Print N lines. The i-th line should contain the value f(i).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: n = int(input())
  ans = [0]*n
  #print(ans)
  for x in range(1,101):
    for y in range(1,101):
      for z in range(1,101):
        temp = x**2+y**2+z**2+x*y+y*z+z*x
        if temp <= n:
          #print(temp)
          ans[temp-1] += 1
  [print(ans[i]) for i in range(n)]
problem_description: Statement
  
  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).
samples: [{"input": "20", "output": "0\n    0\n    0\n    0\n    0\n    1\n    0\n    0\n    0\n    0\n    3\n    0\n    0\n    0\n    0\n    0\n    3\n    3\n    0\n    0\n    \n\n  * For n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n  * For n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n  * For n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n  * For n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3."}]