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;
int _find(long long int m) {
  long long int low = 1;
  long long int high = 100000;
  long long int ret;
  while (low <= high) {
    long long int mid = (low + high) >> 1LL;
    if (mid * mid * mid <= m) {
      ret = mid;
      low = mid + 1LL;
    } else
      high = mid - 1LL;
  }
  return ret;
}
pair<long long int, long long int> call(long long int m) {
  if (m <= 7) return make_pair(m, m);
  long long int a = _find(m);
  pair<long long int, long long int> ret1 = call(m - a * a * a);
  pair<long long int, long long int> ret2 =
      call(a * a * a - 1LL - (a - 1LL) * (a - 1LL) * (a - 1LL));
  if (ret1.first > ret2.first)
    return make_pair(ret1.first + 1LL, ret1.second + a * a * a);
  else if (ret2.first > ret1.first)
    return make_pair(ret2.first + 1,
                     ret2.second + (a - 1LL) * (a - 1LL) * (a - 1LL));
  else if (ret1.second + a * a * a >
           ret2.second + (a - 1LL) * (a - 1LL) * (a - 1LL))
    return make_pair(ret1.first + 1, ret1.second + a * a * a);
  else
    return make_pair(ret1.first + 1,
                     ret2.second + (a - 1LL) * (a - 1LL) * (a - 1LL));
}
int main() {
  long long int m;
  scanf("%lld", &m);
  pair<long long int, long long int> ans = call(m);
  printf("%lld %lld\n", ans.first, ans.second);
  return 0;
}
