#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int A;
ll ret;


void solve() {
	int i,j,k,l,r,x,y,z; string s;
	
	cin>>A;
	for(x=1;x<=333;x++) for(y=1;y<=333;y++) for(z=1;z<=333;z++) {
		int a=x*x*x+y*y*y+z*z*z;
		if(a%333==A) {
			for(ll X=x;X<=4444;X+=333) {
				ll X2=4444LL*4444LL*4444LL*4444LL-X*X*X*X;
				for(ll Y=y;Y<=4444;Y+=333) {
					ll Y2=X2-Y*Y*Y*Y;
					if(Y2<0) break;
					for(ll Z=z;Z<=4444;Z+=333) {
						ll Z2=Y2-Z*Z*Z*Z;
						if(Z2<0) break;
						ret++;
					}
				}
			}
		}
	}
	cout<<ret<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}