#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <climits>
#include <functional>
#include <cassert>
#include <numeric>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define per(i, n) for(int i = (n) - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr int mod = 1000000007;
using namespace std;
template<class T, class U>
bool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }
template<class T, class U>
bool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }
int main(){
  int a;
  cin >> a;
  vvi cnt(333, vi(4445));
  for(ll j = 1; j <= 4444; j++){
    const int v = (j*j*j) % 333;
    cnt[v][j]++;
  }
  rep(i, 333) rep(j, 4444) cnt[i][j+1] += cnt[i][j];
  ll ans = 0;
  const ll mx = 4444LL*4444*4444*4444;
  for(ll i = 1; i <= 4444; i++){
    const ll iv = i*i*i*i;
    const int iv3 = i*i*i % 333;
    for(ll j = i; iv+j*j*j*j <= mx; j++){
      const ll jv = iv+j*j*j*j;
      const int jv3 = (iv3+j*j*j) % 333;
      const int v = (333 - jv3 + a) % 333;
      const int l = sqrt(sqrt(mx - jv));
      if(l < j) continue;
      const ll num = cnt[v][l] - cnt[v][j];
      if(i == j) ans += num * 3;
      else ans += num * 6;
      if(cnt[v][j] - cnt[v][j-1] == 1){
        if(i == j) ans++;
        else ans += 3;
      }
    }
  }
  cout << ans << "\n";
}