import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

N=300
X=int(readline())
C=defaultdict(int)
ans=0
pow_3=[i**3 for i in range(N+1)]
for d in range(N+1):
    c=d
    for b in range(c+1):
        for a in range(b+1):
            C[pow_3[a]+pow_3[b]+pow_3[c]]+=1
    for e in range(d,N+1):
        for f in range(e,N+1):
            ans+=C[X-(pow_3[d]+pow_3[e]+pow_3[f])]
print(ans)