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;
const long long mod = 1000000007;
const long long inf = 1e16;
const long long ninf = LLONG_MIN;
const long double eps = 1e-12;
const long long N = 100005;
const long long LOGN = 19;
long long get(long long x) {
  long long l = 1, r = 1000000, ans;
  while (l <= r) {
    long long mid = (l + r) / 2;
    if (mid * mid * mid <= x) {
      ans = mid;
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  return ans;
}
long long check(long long x) {
  long long ans = 0;
  while (x) {
    long long c = get(x);
    long long y = c * c * c;
    ans += x / y;
    x = x % y;
  }
  return ans;
}
long long findPivot(long long low, long long high) {
  if (high < low) return -1;
  if (high == low) return low;
  long long mid = (low + high) / 2;
  if (mid < high && check(mid) > check(mid + 1)) return mid;
  if (mid > low && check(mid) < check(mid - 1)) return (mid - 1);
  if (check(low) >= check(mid)) return findPivot(low, mid - 1);
  return findPivot(mid + 1, high);
}
int main() {
  ios_base::sync_with_stdio(0);
  long long x;
  cin >> x;
  long long ans = 0;
  long long ma = get(x);
  ma--;
  ma = ma * ma * ma;
  long long curr = check(x);
  long long mm = findPivot(x - ma, x);
  long long a1 = check(mm);
  if (a1 > curr) {
    cout << a1 << " " << mm << "\n";
  } else {
    cout << curr << " " << x << "\n";
  }
  return 0;
}
