#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

int c0[82000000],c1[82000000];

int main(){
	//?
	long long X;
	cin>>X;
	/*
	for(int i=0;i<10;i++){
		for(int j=i;j<10;j++){
			for(int k=j;k<10;k++){
				for(int l=k;l<10;l++){
					for(int m=l;m<10;m++){
						for(int n=m;n<10;n++){
							if(i*i*i+j*j*j+k*k*k+l*l*l+m*m*m+n*n*n==444){
								cout<<i<<j<<k<<l<<m<<n<<endl;
							}
						}
					}
				}
			}
		}
	}
	*/
	
	
	long long ans = 0;
	c0[0]++;
	rep(i,301){
		for(int j=i;j<=300;j++){
			for(int k=j;k<=300;k++){
				c1[i*i*i+j*j*j+k*k*k]++;
			}
		}
	}
	
	long long cur = 0;
	rep(i,82000000){
		if(X-i>=82000000)continue;
		cur += (long long)c0[i] * c1[X-i];
	}
	
	ans += cur;
	for(int i=1;i<=300;i++){
		for(int j=i;j>=i;j--){
			for(int k=j;k>=0;k--){
				for(int l=k;l>=0;l--){
					int nn = j*j*j+k*k*k+l*l*l;
					if(X-nn<82000000&&X-nn>=0)cur -= (long long)c0[nn] * c1[X-nn];
					c0[nn]++;
					if(X-nn<82000000&&X-nn>=0)cur += (long long)c0[nn] * c1[X-nn];
				}
			}
		}
		
		for(int j=i-1;j<=i-1;j++){
			for(int k=j;k<=300;k++){
				for(int l=k;l<=300;l++){
					int nn = j*j*j+k*k*k+l*l*l;
					if(X-nn<82000000&&X-nn>=0)cur -= (long long)c1[nn] * c0[X-nn];
					c1[nn]--;
					if(X-nn<82000000&&X-nn>=0)cur += (long long)c1[nn] * c0[X-nn];
					
				}
			}
		}
		
		ans += cur;
		
	}
	cout<<ans<<endl;
	
	return 0;
}