#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <cmath>
#include <numeric>
#include <stack>
#include <iomanip>
#include <complex>
#include <functional>
#include <tuple>

using namespace std;

#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };

namespace {
    template<typename T> bool chmax(T& a, T b) { if (a <= b) { a = b; return true; } return false; }
    template<typename T> bool chmin(T& a, T b) { if (a >= b) { a = b; return true; } return false; }

    void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; i++) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }

    // 標準入出力
    struct inp {
        std::size_t sz;
        inp(std::size_t _sz = 1) : sz(_sz) {}
        template <typename T> operator T () const { T a; std::cin >> a; return a; }
        template <typename T> operator std::vector<T>() const { std::vector<T> a(sz); for (std::size_t i = 0; i < sz; i++) std::cin >> a[i]; return a; }
    };

    // 2次元用の標準入出力
    template<typename T>
    struct inpn {
        std::size_t szi, szj;
        inpn(std::size_t _szi, std::size_t _szj) : szi(_szi), szj(_szj) {}
        operator std::vector<std::vector<T>>() const {
            std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
            for (std::size_t i = 0; i < szi; ++i)
                for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j];
            return a;
        }
    };

    inp inp1; // input one

    ll pow(ll a, ll n) {
        ll result = 1;
        ll base = a;
        ll mask = 1;
        while (mask <= n) {
            if (n & mask) result *= base;
            mask <<= 1;
            base *= base;
        }
        return result;
    }

    template<typename T>
    std::map<T, T> Factorize2Map(T x) {
        if (x <= 1) return std::map<T, T>();
        std::map<T, T> mp;
        for (T i = 2; i * i <= x; ++i) {
            while (x % i == 0) {
                x /= i;
                mp[i]++;
            }
        }
        if (x != 1) {
            mp[x]++;
        }
        return mp;
    }
}

int main() {

    ll x = inp1;

    ll a, b;

    ll i = 0;
    while (true) {
        ll v = pow(i, 5);
        ll first = x + v;
        ll second = x - v;

        if (first == 0) {
            a = 0;
            b = i;
            break;
        }
        if (second == 0) {
            a = 0;
            b = -i;
            break;
        }
        {
            int sign = 1;
            if (first < 0) sign = -1, first = -first;
            auto fact = Factorize2Map(first);
            int num = 1;
            ll base = 1LL;
            for (auto m : fact) {
                num = m.second;
                if (m.second != 5) break;
                base *= m.first;
            }
            if (num == 5) {
                a = base * sign;
                b = i;
                break;
            }
        }
        {
            int sign = 1;
            if (second < 0) sign = -1, second = -second;
            auto fact = Factorize2Map(second);
            int num = 1;
            ll base = 1LL;
            for (auto m : fact) {
                num = m.second;
                if (m.second != 5) break;
                base *= m.first;
            }
            if (num == 5) {
                a = base * sign;
                b = -i;
                break;
            }
        }
        ++i;
    }

    cout << a << " " << b << endl;

    return 0;
}


Measured memory_bytes: 4028