#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int a; cin >> a;
	long long ans = 0;
	rep2(i, 1, 334)rep2(j, 1, 334)rep2(k, 1, 334) {
		long long x = i * i * i;
		x += j * j * j;
		x += k * k * k;
		x %= 333;
		if (a != x)continue;
		for (long long i2 = i; i2 <= 4444; i2 += 333) {
			for (long long j2 = j; j2 <= 4444; j2 += 333) {
				for (long long k2 = k; k2 <= 4444; k2 += 333) {
					long long w = i2 * i2 * i2 * i2;
					w += j2 * j2 * j2 * j2;
					w += k2 * k2 * k2 * k2;
					if (w <= 4444LL * 4444 * 4444 * 4444)ans++;
				}
			}
		}
	}
	cout << ans << endl;
	return 0;
}