1000000000000000
 994
 200385
 3842529393411
 8
 409477218238717
 2
 419477218238718
 909383000
 7
 999088000000000
 265
 415000000238718
 780869426483087
 9
 850085504652042
 567000123
 980123123123123
 409477218238719
 385925923480002
 999998169714888
 936302451686999
 114
 999999993700000
 108000000057
 409477218238716
 112
 1
 409477218238718
 999971000299999
 409477318238718
 735412349812385
 113
 999999999999999
 123830583943
 899990298504716
 936302451687000
 995
 990000000000000
 936302451687001
 999986542686123
 850085504652041

18 999999993541753
 12 941
 14 200355
 17 3842529383076
 7 7
 17 409477218238717
 2 2
 18 419466459294818
 16 909381874
 7 7
 18 999087986204952
 11 212
 18 414993991790735
 18 780869407920631
 7 7
 18 850085504652042
 16 566998782
 18 980123123116482
 18 409477218238718
 17 385925923479720
 18 999998150030846
 18 936302448662019
 11 114
 18 999999993541753
 17 107986074062
 17 409477218238710
 10 106
 1 1
 18 409477218238718
 18 999969994441746
 18 409477218238718
 18 735409591249436
 10 113
 18 999999993541753
 17 123830561521
 18 899973747835553
 18 936302448662019
 12 995
 18 989983621692990
 18 936302448662019
 18 999969994441746
 18 850085504650655

from math import *
from sys import *

N=int(input())

# if N <= 7:
#     print(N,N)
# elif N <= 15:
#     print(N-7,N)
# elif N <= 23:
#     print(N-14,N)
# else:

memo={}

def solve(n,R):
    if n in memo:
        return memo[n]
    if n == 0:
        return 0,0
    s=floor(pow(n,1/3)-1)
    while (s+1)**3 <= n:
        s += 1
    A,B=solve(n - s ** 3,R)
    if (R>0):
        C,D=solve(s**3-1,R-1)
    else:
        C,D=0,0
    memo[n] = max((A+1,B+s**3),(C,D))
    #print(n, A, B, C, D, memo[n])
    return memo[n]

A,B=solve(N,5)
print(A,B)