/* -*- coding: utf-8 -*-
 *
 * 2510.cc:  No.2510 Six Cube Sum Counting - yukicoder
 */

#include<cstdio>
#include<map>
#include<bitset>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_A = 300;
const int BN = 9 * 10;

/* typedef */

using btst = bitset<BN>;
using mibt = map<int,btst>;

/* global variables */

/* subroutines */

/* main */

int main() {
  int x;
  scanf("%d", &x);

  btst msk((1ULL << 9) - 1);
  mibt scs;
  for (int a = 0; a <= MAX_A; a++) {
    int a3 = a * a * a;
    for (int b = a; b <= MAX_A; b++) {
      int b3 = b * b * b;
      for (int c = b; c <= MAX_A; c++) {
	int s = a3 + b3 + c * c * c;
	auto mit = scs.find(s);
	if (mit == scs.end()) {
	  btst bt = ~msk | btst(c);
	  scs[s] = bt;
	}
	else {
	  mit->second = (mit->second << 9) | btst(c);
	}
      }
    }
  }

  int cnt = 0;
  for (int d = 0; d <= MAX_A; d++) {
    int d3 = d * d * d;
    for (int e = d; e <= MAX_A; e++) {
      int e3 = e * e * e;
      for (int f = e; f <= MAX_A; f++) {
	int s = d3 + e3 + f * f * f;
	if (s <= x) {
	  auto mit = scs.find(x - s);
	  if (mit != scs.end()) {
	    btst bt = mit->second;
	    for (;;) {
	      btst bi = bt & msk;
	      if (bi == msk) break;
	      int c = bi.to_ulong();
	      if (c <= d) cnt++;
	      bt >>= 9;
	    }
	  }
	}
      }
    }
  }

  printf("%d\n", cnt);
  
  return 0;
}