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.*;

class Main{
    public Main(){
        Scanner SC = new Scanner(System.in);
        long X = Long.parseLong(SC.next());

        if(X == 1){
            System.out.println(0 + " " + -1);
            return;
        }
        long MAX = (long)Math.sqrt((double) X)+1;

        long A, B, V, temp;
        for(long i=1;i<MAX;i++){
            if(X % i == 0){
                V = X / i;
                B = 1;
                while(true){
                    A = i + B;
                    if(A*A*A*A*A-B*B*B*B*B == X){
                        System.out.println(A + " " + B);
                        return;
                    }
                    if(A*A*A*A*A+B*B*B*B*B == X){
                        System.out.println(A + " -" + B);
                        return;
                    }
                    B++;
                    if(A*A*A*A-A*A*A*B+A*A*B*B-A*B*B*B+B*B*B*B > V) break;
                }
            }
        }
    }

    public static void main(String args[]){
        Main main = new Main();
    }
}