#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using ll = long long;

constexpr int mod = 333;
ll cnt[4445][mod]; // iまでにz^3がj mod 333であるような数
ll p4[4445];
ll p3[4445];
ll p3m[4445];
int a;
int prev_zmax;
ll zmax_calc;
ll zmax;
int ans;
int ans2;
int left;
int z3;
int z3_calc;

int main(){
    std::cin>>a;
    for(ll z = 1; z <= 4444; z++)
    {
        ll z3 = z*z*z;
        REP(i, mod) cnt[z][i] = cnt[z-1][i];
        cnt[z][z3%mod]++;
        p3[z] = z3;
        p3m[z] = p3[z] % mod;
        p4[z] = z3*z;
    }
    ans = 0;
    ans2 = 0;
    #if 1
    for(int x = 1; x < 4444; x++)
    {
        prev_zmax = 4444;
        zmax_calc = p4[4444] - p4[x];
        z3_calc = a + 2 * mod - p3m[x];
        for(int y = x; y < 4444; y++)
        {
            z3 = (z3_calc - p3m[y]) % mod;
            if(cnt[4443][z3] == 0) continue;
            zmax = zmax_calc - p4[y];
            if(zmax <= 0) break;
            left = 1;
            #if 1
            while(prev_zmax > left + 1)
            {
                int mid = (left + prev_zmax) >> 1;
                ((p4[mid] <= zmax) ? left : prev_zmax) = mid;
                //cerr << left << " " << prev_zmax << endl;
            }
            #endif 
            if(y==x) ans += cnt[left][z3];
            else ans2 += cnt[left][z3];
        }
    }

    #endif
    std::cout << ans + 2 * ans2 << "\n";
}