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;
long long n;
priority_queue<pair<long long, pair<long long, long long>>> q;
long long x = 0, y = 0;
int main() {
  cin >> n;
  q.push({n, {0, 0}});
  while (q.size() > 0) {
    long long e = q.top().first;
    long long d = q.top().second.first;
    long long l = q.top().second.second;
    long long a = 0, b = 100001;
    while (b - a > 1) {
      long long c = (a + b) / 2;
      if (c * c * c <= e) {
        a = c;
      } else {
        b = c;
      }
    }
    q.pop();
    if (e != 0) {
      q.push({e - a * a * a, {d + 1, l + a * a * a}});
      if (a != 1) {
        long long p = a * a * a - 1;
        q.push({p - (a - 1) * (a - 1) * (a - 1),
                {d + 1, l + (a - 1) * (a - 1) * (a - 1)}});
      }
    } else {
      if (d > x || (d == x && l > y)) {
        x = d;
        y = l;
      }
    }
  }
  cout << x << " " << y << endl;
  return 0;
}
