Problem:
Score : 400 points

Problem Statement

Give a pair of integers (A, B) such that A^5-B^5 = X.
It is guaranteed that there exists such a pair for the given integer X.

Constraints

1 \leq X \leq 10^9

X is an integer.

There exists a pair of integers (A, B) satisfying the condition in Problem Statement.

Input

Input is given from Standard Input in the following format:

X

Output

Print A and B, with space in between.
If there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.

A B

Sample Input 1

33

Sample Output 1

2 -1

For A=2 and B=-1, A^5-B^5 = 33.

Sample Input 2

1

Sample Output 2

0 -1

Solution in C++ (GCC 9.2.1) (judge verdict: Accepted)

// myfirstatcoder.cpp : アプリケーションのエントリ ポイントを定義します。

#include "bits/stdc++.h"
#define rep(i,cc,n) for(int i=cc;i<(n);++i)
#define drep(i,cc,n) for(int i=cc;i>(n);--i)
#define llrep(i,cc,n) for(long long i=cc;i<(n);++i)
using namespace std;
using ll = long long;

int main()
{
	int x;
	cin >> x;
	llrep(i, -200, 200)
		llrep(j, -200, 200)
		if (i*i*i*i*i - j * j*j*j*j == x) {
			cout << i << " " << j << endl;
			return 0;
		}
	//cout << a << b << endl;
}

/*
ライブラリ
・string
・vector<int>
::::vector<vector<int>> A(N,vector<int>(M));
::::A[i][j] = i;
・map<string,int>

関数
・rep(i,n) … ループ(i=0;i<N;++i)
・rep_b(i,n) … ループ(i=1;i<=N;++i)
・gcd(int, int) … 最大公約数 int
・find_string(str, str) … 文字列検索 bool
*/