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: Runtime Error)

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int x = in.nextInt();
        // 200^5 - 199^5 = 7920399001 > 10^9 であることから、200まで前探索すればOKっしょ
        for(long a=0; a<=200; a++) {
            long b_init = 0;
            long b_end = a;
            if(a<x) {
                b_init = -200;
                b_end = 0;
            }
            for(long b=b_init; b<=b_end; b++) {
                long a5 = a*a*a*a*a;
                long b5 = b*b*b*b*b;
                if(x==a5-b5) {
                    System.out.print(a);
                    System.out.print(" ");
                    System.out.println(b);
                    return;
                }
            }
        }
        throw new RuntimeException("could not find");
    }
}