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 a[100005];
int index(long long int x) {
  int l = 1, r = 100000, m;
  m = (l + r) / 2;
  int maxm = 1;
  while (l <= r) {
    if (a[m] < x) {
      if (m > maxm) {
        maxm = m;
      }
      l = m + 1;
      m = (l + r) / 2;
    } else if (a[m] > x) {
      r = m - 1;
      m = (l + r) / 2;
    } else if (a[m] == x) {
      return m;
    }
  }
  return maxm;
}
int main() {
  long long int m;
  cin >> m;
  for (long long int i = 1; i <= 100000; i++) {
    a[i] = i * i * i;
  }
  long long int ans = 0, mans = 0, maxx;
  if (m < 8) {
    mans = m;
    maxx = m;
  } else {
    for (long long int i = m;; i--) {
      long long int r = i;
      ans = 0;
      while (r > 0) {
        if (r < 8) {
          ans = ans + r;
          r = 0;
        } else {
          int ind = index(r);
          r = r - a[ind];
          ans = ans + 1;
        }
      }
      if (ans > mans) {
        mans = ans;
        maxx = i;
      } else if (ans == mans) {
        break;
      }
    }
  }
  cout << mans << " " << maxx << "\n";
  return 0;
}
