#include <bits/stdc++.h>
using namespace std;
template <typename Iter>
ostream& _out(ostream& s, Iter a, Iter b) {
  for (auto it = a; it != b; it++) s << (it == a ? "" : " ") << *it;
  return s;
}
template <typename A, typename B>
ostream& operator<<(ostream& s, pair<A, B>& p) {
  return s << "(" << p.first << " , " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& s, vector<T>& v) {
  return _out(s, v.begin(), v.end());
}
inline long long rit() {
  int key = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') key = -1;
    c = getchar();
  }
  long long x = 0;
  while (isdigit(c)) {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * key;
}
int __ = 1;
void init() {}
void read() {}
void solve() {}
long long cnt = 0, pos = 0;
vector<long long> v;
void go(long long n, long long take, long long sum) {
  if (take > cnt) {
    cnt = take;
    pos = sum;
  } else if (take == cnt) {
    pos = max(pos, sum);
  }
  if (n <= 0) return;
  int x = upper_bound(v.begin(), v.end(), n) - v.begin();
  go(n - 1LL * x * x * x, take + 1, sum + 1LL * x * x * x);
  if (x >= 2)
    go(-1 - 1LL * (x - 1) * (x - 1) * (x - 1) + 1LL * x * x * x, take + 1,
       sum + 1LL * (x - 1) * (x - 1) * (x - 1));
}
int main() {
  for (int i = 1; 1LL * i * i * i <= 1e15; i++) {
    v.push_back(1LL * i * i * i);
  }
  long long m;
  cin >> m;
  go(m, 0, 0);
  printf("%lld %lld\n", cnt, pos);
  return 0;
}
