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 Java (OpenJDK 11.0.6) (judge verdict: Time Limit Exceeded)

import java.util.*;
import java.lang.*;

class Main{
    public static void main(String[] args){
        // 入力受付
        Scanner sc = new Scanner(System.in);
        int x = sc.nextInt();

        // 変数定義
        boolean fin = true;    // 終了判定
        int a=0;                 // aの総当たり用変数

        // 総当たり
        while(fin){
            for(int b=0;b<a;b++){
                int a5 = (int)Math.pow(a,5);
                int b5 = (int)Math.pow(b,5);

                // a^5 - b^5
                if(a5-b5==x){
                    // 答えを取得
                    System.out.println(a + " " + b);
                    // ループを抜ける
                    fin=false;
                    break;
                }
                // a^5 - (-b)^5
                else if(a5+b5==x){
                    // 答えを取得
                    System.out.println(a + " " + (-b));
                    // ループを抜ける
                    fin=false;
                    break;
                }
            }
            a++;
        }
    }
}