#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr int M = 300;
constexpr int MX = M * M * M * 3;
int t[MX + 1];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int x;
  cin >> x;
  ll ans = 0;
  rrep(c, M + 1) {
    int vc = c * c * c;
    rrep(b, c + 1) {
      int vb = vc + b * b * b;
      rrep(a, b + 1) {
        int va = vb + a * a * a;
        t[va]++;
      }
    }
  }
  for (int d = M; d >= 0; d--) {
    int vd = x - d * d * d;
    if (vd >= 0) {
      for (int e = d; e <= M; e++) {
        int ve = vd - e * e * e;
        if (ve < 0) break;
        for (int f = e; f <= M; f++) {
          int vf = ve - f * f * f;
          if (vf < 0) break;
          if (vf <= MX) ans += t[vf];
        }
      }
    }
    {
      const int c = d;
      int vc = c * c * c;
      rrep(b, c + 1) {
        int vb = vc + b * b * b;
        rrep(a, b + 1) {
          int va = vb + a * a * a;
          t[va]--;
        }
      }
    }
  }
  cout << ans << '\n';
}