void main() {
  problem();
}

void problem() {
  auto N = scan!int;
  
  int countF(int n) {
    int c;
    foreach(x; 1..101) {
      auto tx = x^^2;
      if (tx > n) break;
      foreach(y; x..101) {
        auto ty = tx + y^^2 + x*y;
        if (ty > n) break;
      
        foreach(z; y..101) {
          auto t = ty + z^^2 + y*z + z*x;
          if (t > n) break;
          if (t == n) {
            if (x == y && y == z) {
              c++;
              continue;
            }
            if (x != y && y != z) {
              c += 6;
              continue;
            }
            c += 3;
          }
        }
      }
    }
    return c;
  }

  void solve() {
    foreach(i; 1..N+1) {
      countF(i).writeln;
    }
  }

  solve();
}

// ----------------------------------------------

import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std.typecons, std.numeric;
T[][] combinations(T)(T[] s, in int m) {   if (!m) return [[]];   if (s.empty) return [];   return s[1 .. $].combinations(m - 1).map!(x => s[0] ~ x).array ~ s[1 .. $].combinations(m); }
string scan(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T scan(T)(){ return scan.to!T; }
T[] scan(T)(int n){ return n.iota.map!(i => scan!T()).array; }
void deb(T ...)(T t){ debug writeln(t); }
alias Point = Tuple!(long, "x", long, "y");

// -----------------------------------------------
