#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;
}
