#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
template <class T>
void _db(const char* dbStr, T e) {
  cout << dbStr << " = " << e << endl;
}
template <class T, class... L>
void _db(const char* dbStr, T e, L... r) {
  while (*dbStr != ',') cout << *dbStr++;
  cout << " = " << e << ',';
  _db(dbStr + 1, r...);
}
template <class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
  o << "[";
  int i = 0;
  for (const pair<S, T>& pr : v)
    o << (!i++ ? "" : ", ") << "{" << pr.first << " : " << pr.second << "}";
  return o << "]";
}
template <template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
  o << "[";
  int i = 0;
  for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
  return o << "]";
}
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
  return o << "(" << pr.first << ", " << pr.second << ")";
}
ostream& operator<<(ostream& o, const string& s) {
  for (const char& c : s) o << c;
  return o;
}
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;
ll bs(ll x) {
  ll lo = 1, hi = 1e6;
  while (lo < hi) {
    ll mid = (lo + hi + 1) >> 1;
    if (mid * mid * mid <= x)
      lo = mid;
    else
      hi = mid - 1;
  }
  return lo;
}
int f(ll m) {
  int ret = 0;
  while (m) {
    ll p = bs(m);
    ll y = p * p * p, yy = (p - 1) * (p - 1) * (p - 1);
    m = max(y - 1 - yy, m - y);
    ++ret;
  }
  return ret;
}
ll getMin(int A) {
  ll lo = 0, hi = 1e16;
  while (lo < hi) {
    ll mid = (lo + hi) >> 1;
    if (f(mid) >= A)
      hi = mid;
    else
      lo = mid + 1;
  }
  return lo;
}
int main() {
  ios::sync_with_stdio(false);
  cout.precision(10);
  cin.tie(0);
  ll m, tot = 0, cnt = 0;
  cin >> m;
  while (m) {
    int ans = f(m);
    ll nextM = getMin(ans - 1);
    ll p = bs(m);
    ll y = p * p * p, yy = (p - 1) * (p - 1) * (p - 1);
    if (nextM <= m - y)
      tot += y, m = m - y;
    else
      tot += yy, m = y - 1 - yy;
    ++cnt;
  }
  cout << cnt << ' ' << tot << '\n';
  return 0;
}
