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 book[100005] = {1}, Num[100005] = {0};
int main() {
  long long m, i, t, j, N = 0, X = 0, ansn = 0, ansX = 0, flag = 0, k, l,
                        all = 0;
  scanf("%I64d", &m);
  for (i = 1;; i++) {
    book[i] = i * i * i;
    Num[i - 1] = (book[i] - all) / book[i - 1];
    if ((book[i] - all) % book[i - 1] == 0) {
      Num[i - 1]--;
    }
    all += Num[i - 1] * book[i - 1];
    if (book[i] > m) {
      Num[i - 1] = m / book[i - 1];
      t = i;
      break;
    }
  }
  for (i = 1; i < t; i++) {
    if (X + Num[i] * book[i] <= m) {
      X += Num[i] * book[i];
      N += Num[i];
      continue;
    } else {
      for (j = 1; j <= Num[i]; j++) {
        if (X + book[i] <= m) {
          N++;
          X += book[i];
        } else {
          flag = 1;
          break;
        }
      }
    }
    if (flag) {
      break;
    }
  }
  for (l = 0; l < j; l++) {
    if (X - book[i] + book[i + 1] <= m && book[i + 1]) {
      X = X - book[i] + book[i + 1];
    } else {
      break;
    }
  }
  for (k = i; k >= 2; k--) {
    for (l = 0; l <= Num[k]; l++) {
      if (X - book[k - 1] + book[k] <= m) {
        X = X - book[k - 1] + book[k];
      } else {
        break;
      }
    }
  }
  printf("%I64d %I64d\n", N, X);
}
