#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

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll a;
    cin >> a;

    vector<vector<ll>> b(333LL);
    rep(i, 333LL){
        rep(z, 333LL){
            if((z*z*z)%333LL == i) b[i].pb(z);
        }
    }

    ll ans = 0LL;
    ll P = 4444LL*4444LL*4444LL*4444LL;
    for(ll x=1; x*x*x*x <= P; x++){
        for(ll y=1; y*y*y*y <= P-x*x*x*x; y++){
            ll c = P - x*x*x*x - y*y*y*y;
            ll r = a - (x*x*x)%333LL - (y*y*y)%333LL + 333LL + 333LL;
            r %= 333LL;
            ll lw = -1;
            ll hi = 4444;
            ll mid;
            while(hi - lw > 1){
                mid = (lw + hi)/2;

                if(mid*mid*mid*mid <= c) lw = mid;
                else hi = mid;
            }
            if(lw == -1) continue;
            for(ll z : b[r]){
                if(z==0){
                    ll n = lw/333LL;
                    ll m = lw%333LL;
                    ans += n;
                }else{
                    ll n = lw/333LL;
                    ll m = lw%333LL;
                    ans += n;
                    if(z <= m) ans++;
                }
            }
        }
    }
    
    cout << ans << endl;
}