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.*;
import java.math.BigInteger;

public class Main {
    public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);
      int X = Integer.parseInt(sc.next());
      int A = X;
      int B = 0;
      long x = 0;
      int W = 0;
      int M[] = new int[10000000];
      while(x < Math.pow(10,10)){
        M[W] = W*W*W*W*W;
        x = M[W];
        W++;
        if(x < 0){
          M[W] = 0;
          break;
        }

      }

      for(int i = 99; i > -1; i--){
        for(int j = 0; j < 100; j++){
          if(M[i] - M[j] == X){
            A = i;
            B = j;
            System.out.println(A+" "+B);
            System.exit(0);
          }else if(M[i] + M[j] == X){
            A = i;
            B = -1*j;
            System.out.println(A+" "+B);
            System.exit(0);
          }else if(M[j] - M[i] == X){
            A = -1*i;
            B = -1*j;
            System.out.println(A+" "+B);
            System.exit(0);
          }
          else if(-1*M[i] - M[j] == X){
            A = -1*i;
            B = j;
            System.out.println(A+" "+B);
            System.exit(0);
          }
        }
      }

}
}