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 int oo = 0x3f3f3f3f;
int main() {
  long long int q, i, area, next, cont;
  long long int maxi = 0;
  cin >> q;
  vector<long long int> v;
  area = 0;
  i = 1;
  cont = 0;
  next = area + i * i * i;
  while (true) {
    if (next <= q && next < (i + 1) * (i + 1) * (i + 1)) {
      cont++;
      area = next;
      v.push_back(i);
      maxi = max(maxi, i);
      next = area + i * i * i;
    } else if (next <= q && next >= (i + 1) * (i + 1) * (i + 1)) {
      i++;
      next = area + i * i * i;
    } else {
      break;
    }
  }
  maxi++;
  vector<long long int>::reverse_iterator it;
  for (it = v.rbegin(); it != v.rend();) {
    i = *it;
    if (area - (i * i * i) + (i + 1) * (i + 1) * (i + 1) <= q &&
        area - (i * i * i) + (i + 1) * (i + 1) * (i + 1) <
            (maxi + 1) * (maxi + 1) * (maxi + 1)) {
      area += (i + 1) * (i + 1) * (i + 1) - (i * i * i);
      (*it)++;
      maxi = max(maxi, (*it) + 1);
    } else {
      it++;
    }
  }
  cout << cont << ' ' << area << endl;
  return 0;
}
