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 md = 1000000007;
long long exp(long long a, long long b) {
  long long r = 1;
  while (b > 0) {
    if (b & 1) {
      r = r * (a % md);
      r = (r + md) % md;
    }
    b >>= 1;
    a = (a % md) * (a % md);
    a = (a + md) % md;
  }
  return (r + md) % md;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long Min(int a, int b) {
  if (a < b) return a;
  return b;
}
long long Max(int a, int b) {
  if (a > b) return a;
  return b;
}
long long binsrch(long long x) {
  if (x == 8) return 2;
  if (x < 8 && x > 0) return 1;
  long long l = 2, r = 100000, mid, ans = 1;
  while (l <= r) {
    mid = l + (r - l) / 2;
    long long temp = mid * mid * mid;
    if (temp == x) return mid;
    if (temp > x)
      r = mid - 1;
    else {
      ans = mid;
      l = mid + 1;
    }
  }
  return ans;
}
long long fun(long long x, long long &ans) {
  if (x <= 7) {
    ans = x;
    return x;
  }
  long long a = binsrch(x);
  long long a1, a2;
  a1 = a2 = ans;
  long long p = fun(x - a * a * a, a1);
  long long q = fun(a * a * a - (a - 1) * (a - 1) * (a - 1) - 1, a2);
  if (p >= q) {
    ans += (a1 + a * a * a);
    return p + 1;
  } else
    ans += ((a - 1) * (a - 1) * (a - 1) + a2);
  return q + 1;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  long long ans = 0, cnt;
  cnt = fun(t, ans);
  cout << cnt << " " << ans << "\n";
  return 0;
}
