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

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
map<long long, pair<long long, long long> > dp;
pair<long long, long long> DP(long long x) {
  if (dp.count(x)) return dp[x];
  long long lb = 0, ub = 1e5 + 100;
  while (ub - lb > 1) {
    long long mid = (lb + ub) / 2;
    if (mid * mid * mid <= x)
      lb = mid;
    else
      ub = mid;
  }
  long long K = lb * lb * lb;
  pair<long long, long long> tmp = DP(x % K);
  pair<long long, long long> t = DP(K - 1);
  dp[x] =
      max(pair<long long, long long>(tmp.first + x / K, tmp.second + x / K * K),
          make_pair(t.first + x / K - 1, t.second + (x / K - 1) * K));
  return dp[x];
}
int main() {
  dp[0] = pair<long long, long long>(0, 0);
  long long m;
  cin >> m;
  printf("%lld %lld\n", DP(m).first, DP(m).second);
}
