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: Time Limit Exceeded)


import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long x = sc.nextLong();
        long a = 0, b = -1;
        boolean flag = false;
        while(!flag){
            b++;
            if(b != 0 && x % b != 0){
                continue;
            }
            for(a = 0;;a++) {
                long l = a*a*a*a*a-b*b*b*b*b;
                if (l == x){
                    flag = true;
                    break;
                }else if(l > x){
                    break;
                }
            }
            for(a = 0;;a++) {
                long l = a*a*a*a*a+b*b*b*b*b;
                if (l == x){
                    flag = true;
                    b = -b;
                    break;
                }else if(l > x){
                    break;
                }
            }
        }
        System.out.println(a + " " + b);
    }
}