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.*;
public class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int a = scan.nextInt();
        int b = 1;
        int ans1 = 0;
        int ans2 = 0;
        if(a!=1){
            for(int l=2;l<a;l++){
                if(a%l==0){
                    b=l;
                    break;
                }
            }
            int i=0;
            while(true){
                int x = (int)Math.pow(b-i,5);
                int y = (int)Math.pow(-i,5);
                int p = x-y;
                int q = -x+y;
                if(a==p){
                    ans1=b-i;
                    ans2=-(i);
                    break;
                }else if(a==q){
                    ans1=-(b-i);
                    ans2=i;
                    break;
                }
            }
        }else{
            ans1=1;
            ans2=0;
        }
        System.out.print(ans1);
        System.out.print(" ");
        System.out.print(ans2);
    }
}