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>
const int INF = 1e9 + 7;
const long long INFLL = 1e16;
const double EPS = 1e-6;
using namespace std;
long long n;
long long cube(long long a) { return a * a * a; }
vector<long long> use;
long long sum() {
  long long ret = 0;
  for (int k = (int)0; k < (int)use.size(); k++) ret += cube(use[k]);
  return ret;
}
int cocok() {
  long long ret = sum();
  vector<long long> tmp;
  while (ret) {
    long long l = 1, r = 100000;
    while (l <= r) {
      long long mid = (l + r) >> 1;
      if (cube(mid) <= ret)
        l = mid + 1;
      else
        r = mid - 1;
    }
    ret -= cube(r);
    tmp.push_back(r);
  }
  reverse(tmp.begin(), tmp.end());
  if (tmp.size() != use.size()) return 0;
  for (int k = (int)0; k < (int)tmp.size(); k++)
    if (tmp[k] != use[k]) return 0;
  return 1;
}
int main() {
  scanf("%I64d", &n);
  long long ret = 0;
  int cnt = 0;
  long long now = 1;
  long long last;
  while (ret <= n) {
    if (ret + cube(now) > n) break;
    if (ret + cube(now) < cube(now + 1)) {
      ret += cube(now), cnt++;
      use.push_back(now);
    } else
      now++;
  }
  long long ans = ret;
  for (int k = use.size() - 1; k >= (int)0; k--) {
    while (1) {
      use[k]++;
      if (cocok() && sum() <= n)
        continue;
      else {
        use[k]--;
        break;
      }
    }
  }
  printf("%d %I64d\n", cnt, sum());
  return 0;
}
