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;
pair<int, long long> dp[10000000];
pair<int, long long> cdp[100000];
long long cubes[100001];
int getcube(long long val) {
  int i = lower_bound(cubes, cubes + 100001, val) - cubes;
  if (val == cubes[i]) return i;
  return i - 1;
}
pair<int, long long> solve(long long val) {
  if (val < 0) val = 0;
  if (val < 10000000) return dp[val];
  long long cb = getcube(val);
  long long cbb = cb * cb * cb;
  auto a = solve(val - cbb);
  a.first++;
  a.second += cbb;
  auto b = cdp[cb];
  return max(a, b);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  for (long long i = 0; i <= 100000; i++) cubes[i] = i * i * i;
  dp[0] = make_pair(0, 0ll);
  dp[1] = make_pair(1, 1ll);
  for (long long i = 1, j = 1; i < 10000000; i++) {
    int k = j - 1;
    if (j * j * j == i) {
      dp[i] = make_pair(1, i);
      j++;
    } else {
      dp[i] = make_pair(dp[i - k * k * k].first + 1, i);
    }
  }
  for (long long i = 2; i < 10000000; i++) {
    dp[i] = max(dp[i], dp[i - 1]);
  }
  cdp[1] = dp[1];
  for (long long i = 2; i < 100000; i++) {
    cdp[i] = max(cdp[i - 1], solve(i * i * i - 1));
  }
  long long m;
  cin >> m;
  long long maxv = 1e15;
  if (m == maxv) m--;
  auto ans = solve(m);
  cout << ans.first << ' ' << ans.second << endl;
  return 0;
}
