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.*;
 
class Main {
  public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
    
    int x = sc.nextInt(); //next(文字列), nextDouble, nextLine(1行)とか
    if (x == 1){
            System.out.println(0+" "+-1);
            return;
    }
    
    for (int i = 2; i<=x;i++){
      if (x%i == 0){
        for (int j = 1; j<x;j++){
          int A = j;
          int B = A - i;
          if (Math.pow(A,4)+Math.pow(A,3)*B+Math.pow(A,2)*Math.pow(B,2)+A*Math.pow(B,3)+Math.pow(B,4) == x/i){
            System.out.println(A+" "+B);
            return;
          }
        }
      }
    } 
  }
}