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;
vector<long long> value, cnt, las;
int main() {
  long long n;
  cin >> n;
  long long x = 0, cn = 0, la = 1;
  while (x <= n) {
    long long y = x + la * la * la;
    long long z = (la + 1) * (la + 1) * (la + 1);
    if (y < z) {
      x = y;
      cn++;
      value.push_back(x);
      cnt.push_back(cn);
      las.push_back(la);
    } else {
      int s = value.size() - 1;
      y = value[s] - (las[s] * las[s] * las[s]) + (la * la * la);
      if (y < z && y != value[s]) {
        value.push_back(y);
        las.push_back(la);
        cnt.push_back(cn);
      }
      la++;
    }
  }
  long long res = value[value.size() - 2];
  long long st = las[value.size() - 2], anc = cnt[cnt.size() - 2], en = st + 1;
  while (1) {
    long long p = res - (st * st * st) + ((st + 1) * (st + 1) * (st + 1));
    if (p <= n) {
      res = p;
      st = st + 1;
    } else
      break;
  }
  cout << anc << " " << res << endl;
}
