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) def Compress(lst): decomp=sorted(list(set(lst))) comp={x:i for i,x in enumerate(decomp)} return comp,decomp N=300 X=int(readline()) comp,decomp=Compress([a**3+b**3+c**3 for a in range(N+1) for b in range(a,N+1) for c in range(b,N+1)]) le=len(comp) C=defaultdict(int) ans=0 for d in range(N+1): c=d for b in range(c+1): for a in range(b+1): C[a**3+b**3+c**3]+=1 for e in range(d,N+1): for f in range(e,N+1): ans+=C[X-(d**3+e**3+f**3)] print(ans)