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 int pow_mod(long long int a, long long int b) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
int main() {
  long long int m;
  cin >> m;
  long long int res = 0;
  int cnt = 0;
  vector<long long int> v;
  long long int i = 1;
  while (i * i * i <= m) {
    if ((res + i * i * i <= m) &&
        (res + i * i * i < (i + 1) * (i + 1) * (i + 1))) {
      v.push_back(i);
      res += i * i * i;
      cnt += 1;
    } else {
      i += 1;
    }
  }
  for (int i = (int)(v.size() - 1); i >= 0; --i) {
    long long int tmp1 = v[i];
    long long int tmp2 = res - (v[i] * v[i] * v[i]);
    while (tmp2 + (tmp1 + 1) * (tmp1 + 1) * (tmp1 + 1) <= m) {
      long long int prev = v[i];
      v[i] = (tmp1 + 1);
      bool flag = true;
      long long int tmp = 0;
      for (int j = 0; j < (int)(v.size()); ++j) {
        tmp += v[j] * v[j] * v[j];
        if (tmp >= (v[j] + 1) * (v[j] + 1) * (v[j] + 1)) {
          flag = false;
          break;
        }
      }
      v[i] = prev;
      if (flag) {
        tmp1 += 1;
      } else {
        break;
      }
    }
    res = tmp2 + tmp1 * tmp1 * tmp1;
    v[i] = tmp1;
  }
  cout << cnt << " " << res << endl;
  return 0;
}
