#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{ 
    ll x;
    cin >> x;
    ll ans = 0;
    vector<int> s;
    vector<tuple<int,int,int>> snum;
    set<int> st;
    map<int, tuple<int,int,int>> mp;
    set<vector<int>> D;
    for(int i=0;i<=300;i++){
      for(int j=i;j<=300;j++){
        for(int k=j;k<=300;k++){
          int val = i*i*i+j*j*j+k*k*k;
          s.push_back(val);
          snum.push_back({i,j,k});
          mp[val] = {i,j,k};
          st.insert(val);
        }
      }
    }
    rep(i,s.size()){
      int a = s[i];
      if(st.count(x-a)) {
        vector<int> vs;
        auto [b,c,d] = mp[x-a];
        vs.push_back(b);
        vs.push_back(c);
        vs.push_back(d);
        auto [e,f,g] = snum[i];
        vs.push_back(e);
        vs.push_back(f);
        vs.push_back(g);
        sort(vs.begin(),vs.end());
        D.insert(vs);
      }
    }
    cout << D.size() << endl;
    return 0;
}