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;
inline long long cube(long long i) { return (i * i * i); }
long long find(long long val, long long b = 1, long long e = 100000) {
  if (b == e) return b;
  if (e - b == 1) return (cube(e) <= val) ? e : b;
  long long m = (b + e) / 2;
  if (cube(m) <= val) {
    if (cube(m + 1) <= val)
      return find(val, m + 1, e);
    else
      return m;
  } else
    return find(val, b, m - 1);
}
int count(long long n) {
  if (n == 0) {
    return 0;
  }
  if (n == 1) {
    return 1;
  }
  long long x = find(n);
  int val = (cube(x) == n) ? 1 : 0;
  long long y = max(cube(x) - cube(x - 1) - 1, n - cube(x) - val);
  return 1 + count(y);
}
long long get(long long n) {
  if (n == 0) {
    return 0;
  }
  if (n == 1) {
    return 1;
  }
  long long x = find(n);
  int val = (cube(x) == n) ? 1 : 0;
  int a = count(cube(x) - cube(x - 1) - 1);
  int b = count(n - cube(x) - val);
  if (a <= b) {
    return cube(x) + get(n - cube(x) - val);
  } else
    return cube(x - 1) + get(cube(x) - cube(x - 1) - 1);
}
int main(int argc, char const *argv[]) {
  long long n;
  cin >> n;
  cout << count(n) << " " << get(n) << endl;
  return 0;
}
