#include <bits/stdc++.h>
using namespace std;

using T = tuple<int, int, int>;

int main() {
  vector<int> cb(301);
  for( int i = 0; i <= 300; i++ ) cb[i] = i*i*i;
  unordered_map<int, vector<T>> mp;
  for( int a = 0; a <= 300; a++ ) {
    for( int b = a; b <= 300; b++ ) {
      for( int c = b; c <= 300; c++ ) {
        int x = cb[a]+cb[b]+cb[c];
        mp[x].push_back(make_tuple(a, b, c));
      }
    }
  }
  int X;
  cin >> X;
  long long ans = 0;
  for( int a = 0; a <= 300; a++ ) {
    for( int b = a; b <= 300; b++ ) {
      for( int c = b; c <= 300; c++ ) {
        int x = cb[a]+cb[b]+cb[c];
        if( mp.count(X-x) ) {
          int t = mp[X-x].end()-lower_bound(mp[X-x].begin(), mp[X-x].end(), make_tuple(c, c, c));
          ans += t;
          // if( t > 0 ) cout << a << " " << b << " " << c << " " << t << endl;
        }
      }
    }
  }
  cout << ans << endl;
}