#include using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; template using minheap = priority_queue, greater>; template using maxheap = priority_queue; template bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template int flg(T x, int i) { return (x >> i) & 1; } template void print(const vector &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template void printn(const vector &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template int lb(const vector &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template int ub(const vector &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template void rearrange(vector &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template vector id_sort(const vector &v, bool greater = false) { int n = v.size(); vector ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template pair operator+(const pair &p, const pair &q) { return make_pair(p.first + q.first, p.second + q.second); } template pair operator-(const pair &p, const pair &q) { return make_pair(p.first - q.first, p.second - q.second); } template istream &operator>>(istream &is, pair &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template ostream &operator<<(ostream &os, const pair &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; const int inf = (1 << 30) - 1; const ll INF = (1LL << 60) - 1; // const int MOD = 1000000007; const int MOD = 998244353; template T kth_root_integer(T a, int k) { if (k == 1) return a; auto check = [&](T x) { T mul = 1; for (int j = 0; j < k; j++) { if (__builtin_mul_overflow(mul, x, &mul)) return false; } return mul <= a; }; int n = 4 * sizeof(T); T ret = 0; for (int i = n - 1; i >= 0; i--) { if (check(ret | (T(1) << i))) ret |= T(1) << i; } return ret; } int main() { int A; cin >> A; int M = 333; int N = 111; vector pw3(N + 1, 1); rep(i, N + 1) pw3[i] = 1LL * i * i * i; int L = 4444; vector pw4(L + 1, 1); rep(i, L + 1) pw4[i] = 1LL * i * i * i * i; ll ma = pw4[L]; ll ans = 0; auto dfs = [&](int i, vector v, ll S, auto &&dfs) -> ll { if (i == 2) { int t = ub(pw4, S) - 1; if (t < v[2]) return 0; return (t - v[2]) / N + 1; } ll ret = 0; for (ll p = v[i];; p += N) { ll NS = S - pw4[p]; if (NS < 0) break; ret += dfs(i + 1, v, NS, dfs); } return ret; }; rep2(x, 1, N + 1) rep2(y, 1, N + 1) rep2(z, 1, N + 1) { int r = z + N * ((L - z) / N); int c = (L - z) / N + 1; ll t = pw3[x] + pw3[y] + pw3[z]; if (t % M == A) { for (ll i = x; i <= L && pw4[i] <= ma; i += N) { for (ll j = y; j <= L && pw4[i] + pw4[j] <= ma; j += N) { // ll S = ma - pw4[i] - pw4[j]; int s = r, cnt = c; while (pw4[s] > ma - pw4[i] - pw4[j]) cnt--, s -= N; ans += cnt; } } } } cout << ans << '\n'; }