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;
std::vector<long long> v;
long long c[100005];
bool check() {
  long long sum = 0, i;
  for (i = 0; i < v.size(); i++) {
    sum += c[v[i]];
    if (sum > c[v[i] + 1]) return false;
  }
  return true;
}
int main() {
  long long res = 0, i, M, ans = 0;
  for (i = 0; i < 100005; i++) {
    c[i] = 1LL * i * i * i;
  }
  cin >> M;
  i = 1;
  while (res + c[i] <= M) {
    if (res + c[i] < c[i + 1]) {
      res += c[i];
      ans++;
      v.push_back(i);
    } else
      i++;
  }
  for (i = v.size() - 1; i >= 0; i--) {
    while (res + c[v[i] + 1] - c[v[i]] <= M) {
      v[i]++;
      if (check()) {
        res = res - c[v[i] - 1] + c[v[i]];
      } else {
        v[i]--;
        break;
      }
    }
  }
  cout << ans << " " << res << endl;
}
