#include <bits/stdc++.h>
using namespace std;
const int nmax = 100000;
long long v[nmax + 1];
long long a[nmax + 1];
inline long long p3(long long x) { return x * x * x; }
inline long long solve(long long x, bool tip) {
  long long ans = 0;
  while (x) {
    long long y = cbrt(x);
    if (tip) cout << y << " ";
    ++ans;
    x -= p3(y);
  }
  if (tip) cout << "\n";
  return ans;
}
int main() {
  long long m, sum, ind;
  int cate = 0;
  cin >> m;
  sum = 0;
  ind = 1;
  while (sum <= m) {
    while (ind <= 1e5 && sum + p3(ind) >= p3(ind + 1)) {
      ++ind;
    }
    if (sum + p3(ind) > m) {
      break;
    }
    a[++cate] = p3(ind);
    v[cate] = ind;
    sum += p3(ind);
  }
  for (int i = 1; i <= cate; ++i) {
    a[i] += a[i - 1];
  }
  cout << cate << " ";
  long long sum2 = 0, last = (1LL << 60);
  long long dif = (1LL << 60);
  for (int i = cate; i > 0; --i) {
    long long x = (long long)cbrt(m - a[i - 1] - sum2);
    if (x > last) {
      x = last;
    }
    if (x < v[i]) {
      x = v[i];
    }
    if (p3(x) - p3(v[i]) >= dif) {
      x = (long long)cbrt(dif + p3(v[i]));
    }
    dif = dif - p3(x) + p3(v[i]);
    if (dif > p3(x + 1) - p3(x) - a[i - 1]) {
      dif = p3(x + 1) - p3(x) - a[i - 1];
    }
    sum2 += p3(x);
    last = x;
  }
  cout << sum2 << "\n";
  return 0;
}
