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>
using namespace std;
const double PI = acos(-1);
const double E = 2.718281828459;
const int INF = 2e9;
const long long MOD = 1e9 + 7;
const int MAXN = 1e5 + 1;
pair<int, long long> get(long long x) {
  if (x >= 1 && x <= 7) {
    return make_pair(x, x);
  }
  long long lo = 0, hi = 1e5 + 2;
  while (lo < hi) {
    long long mid = (lo + hi + 1) / 2;
    if (mid * mid * mid > x)
      hi = mid - 1;
    else
      lo = mid;
  }
  long long k = lo;
  int idx = 7;
  long long num = 7;
  if (x >= 23) {
    idx = 9, num = 23;
  } else if (x == 22) {
    idx = 8, num = 22;
  } else if (x == 21) {
    idx = 7, num = 21;
  }
  for (long long i = 0; i <= k; ++i) {
    long long tmp = x - i * i * i;
    if (tmp < 0) break;
    if (tmp > 3 * i * i + 3 * i) continue;
    pair<int, long long> ret = get(tmp);
    if (ret.first + 1 > idx) {
      idx = ret.first + 1;
      num = ret.second + i * i * i;
    } else if (ret.first + 1 == idx) {
      num = max(num, ret.second + i * i * i);
    }
  }
  return make_pair(idx, num);
}
int main() {
  long long m;
  cin >> m;
  pair<int, long long> ans = get(m);
  cout << ans.first << " " << ans.second << endl;
  return 0;
}
