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: Wrong Answer)

import java.util.Scanner;

public class Main {
    public static void main(String args[]){

        Scanner sc = new Scanner(System.in);
        int x = sc.nextInt();

        int ansA = 0;
        int ansB = 0;

        int breakPointCheck = 0;

        boolean isBreak = false;
        for(int a = -118;a <= 119;a++){//aを-118から119まで回す
            for(int b = -119;b < 118;b++){//bを-119から118まで回す
                if((a^5 - b^5) == x){//答えが見つかれば代入
                    ansA = a;
                    ansB = b;
                    isBreak = true;//a側のfor文を抜けるためのチェック
                    break;
                }
            }
            if(isBreak){
            break;
            }
        }
        System.out.println(ansA + " " + ansB);
    }
}