#include <iostream>
#include <unordered_map>

using namespace std;

int main() {
    const int N = 300;
    int X;
    cin >> X;

    unordered_map<int, int> C;
    int ans = 0;

    for (int d = 0; d <= N; ++d) {
        int c = d;
        for (int b = 0; b <= c; ++b) {
            for (int a = 0; a <= b; ++a) {
                C[a * a * a + b * b * b + c * c * c]++;
            }
        }
        for (int e = d; e <= N; ++e) {
            for (int f = e; f <= N; ++f) {
                ans += C[X - (d * d * d + e * e * e + f * f * f)];
            }
        }
    }

    cout << ans << endl;

    return 0;
}