#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//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 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 pw3(int n) {return n * n * n;}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	const int mx = 300;
	const int lim = pw3(mx) * 3;
	vector<int>cnt(lim + 1);
	int x; cin >> x;
	int ans = 0;
	rep2(d, 0, mx + 1) {
		int c = d;
		const int pw3d = pw3(d);
		rep2(a, 0, c + 1) {
			rep2(b, a, c + 1) {
				cnt[pw3(a) + pw3(b) + pw3d]++;
			}
		}
		rep2(e, d, mx + 1) {
			rep2(f, e, mx + 1) {
				int y = x - pw3d - pw3(e) - pw3(f);
				if (y < 0)break;
				if (y > lim)continue;
				ans += cnt[y];
			}
		}
	}
	cout << ans << endl;
	return 0;
}