#include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, s, n) for (i64 i = (s), i##_limit = (n); i < i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#define repc(i, s, t) for (i64 i = (s), i##_limit = (t); i <= i##_limit; ++i)
#define var(type, ...) \
    type __VA_ARGS__;  \
    read(__VA_ARGS__);
#ifndef DBG
#define dump(...)
#endif
using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template <class T, class U>
inline bool chmax(T &a, const U &b) {
    return b > a && (a = b, true);
}
template <class T, class U>
inline bool chmin(T &a, const U &b) {
    return b < a && (a = b, true);
}
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;

template <class T>
inline vector<T> makeV(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeV(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(makeV<T>(initValue, args...))>(
        sz, makeV<T>(initValue, args...));
}

template <class T>
inline istream &operator>>(istream &is, vector<T> &vec) {
    for (auto &e : vec) is >> e;
    return is;
}

inline void read() {}

template <class Head, class... Tail>
inline void read(Head &head, Tail &... tail) {
    cin >> head;
    read(tail...);
}

inline void print() { cout << "\n"; }

template <class Head, class... Tail>
inline void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << ' ';
    print(forward<Tail>(tail)...);
}

template <class T>
inline ostream &operator<<(ostream &os, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e : vec) os << e << delim[&e == &vec.back()];
    return os;
}

template <class Container>
struct Rev {
    Container &x_;
    inline Rev(Container &x) : x_(x) {}
    inline auto begin() { return rbegin(x_); }
    inline auto end() { return rend(x_); }
};
// }}} End Header

i64 f(i64 n) { return n * n * n * n * n; }

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.setf(ios_base::fixed);
    cout.precision(12);

    var(i64, X);

    vector<i64> buf;
    buf.reserve(1e5);
    rep(i, 0, 1e5) {
        if (f(i) > i64(1e18)) break;
        buf.push_back(f(i));
    }

    const int N = buf.size();
    dump(N);

    rep(i, 0, N) rep(j, 0, N) {
        if (buf[i] - buf[j] == X) {
            print(i, j);
            return 0;
        }
        if (buf[i] + buf[j] == X) {
            print(i, -j);
            return 0;
        }
        if (-buf[i] - buf[j] == X) {
            print(-i, j);
            return 0;
        }
        if (-buf[i] + buf[j] == X) {
            print(-i, -j);
            return 0;
        }
    }

    /* rep(i, 0, N) { */
    /*     const i64 a = buf[i]; */
    /*     const i64 b = a - X; */
    /*     if (i < 10) dump(a, b); */
    /*     if (b < 0) { */
    /*         auto itr = lower_bound(all(buf), abs(b)); */
    /*         if (itr != buf.end() && *itr == abs(b)) { */
    /*             print(i, -(itr - begin(buf))); */
    /*             return 0; */
    /*         } */
    /*     } else { */
    /*         auto itr = lower_bound(all(buf), abs(b)); */
    /*         if (itr != buf.end() && *itr == abs(b)) { */
    /*             print(i, (itr - begin(buf))); */
    /*             return 0; */
    /*         } */
    /*     } */
    /* } */

    return 0;
}


Measured memory_bytes: 3660