#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    ll x; cin >> x;
    unordered_map<ll, vector<short>> mp1, mp2;
    for(ll a=0; a<=300; a++) for(ll b=a; b<=300; b++) for(ll c=b; c<=300; c++){
        if(a*a*a+b*b*b+c*c*c<=x){
            mp2[a*a*a+b*b*b+c*c*c].pb((short)a);
            mp1[a*a*a+b*b*b+c*c*c].pb((short)c);
        }
    }
    ll ans = 0;
    for(auto itr=mp1.begin(); itr!=mp1.end(); itr++){
        ll y = x-(*itr).fi;
        if(mp2.find(y)==mp2.end()) continue;
        for(short c : (*itr).se){
            ans += (ll)mp2[y].size() - (lower_bound(all(mp2[y]), c)-mp2[y].begin());
        }
    }

    cout << ans << endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}