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 1.8.0) (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 A = 0;
        int B = 0;
        
        int[] C = new int[65];
        for(int i = 0; i < 65 ; i++){
            C[i] = (i + 1) * (i + 1) * (i + 1) * (i + 1) * (i + 1);
        }
        
        for(int i = 65; i > 0; i--){
            if(X > C[i - 1]){
                A = i;
                break;
            }
        }
        
        X = X - (A * A * A * A * A);
        for(int i = 65; i > 0; i--){
            if(X == C[i - 1]){
                B = - i;
                break;
            }
        }
        
        System.out.println(A + " " + B);
    
    }
}