#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int A = 300;
  int x; cin >> x;
  array<int, A * A * A * 3 + 1> num{};
  ll ans = 0;
  REP(d, A + 1) {
    const int r1 = x - d * d * d;
    if (r1 - d * d * d * 2 < 0) break;
    REP(a, d + 1) FOR(b, a, d + 1) {
      ++num[a * a * a + b * b * b + d * d * d];
    }
    FOR(e, d, A + 1) {
      const int r2 = r1 - e * e * e;
      if (r2 - e * e * e < 0) break;
      FOR(f, e, A + 1) {
        const int r3 = r2 - f * f * f;
        if (r3 < 0) break;
        if (r3 <= A * A * A) ans += num[r3];
      }
    }
  }
  cout << ans << '\n';
  return 0;
}