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: Accepted)

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        List<Long> temp = new ArrayList<>();
        long tempNumber;
        for (long i = 0L; i < 150; i++) {
            tempNumber = i * i * i * i * i;
            temp.add(tempNumber);
            temp.add(-tempNumber);
        }
        temp.add(0L);
        long x = Long.parseLong(scanner.next());
        for (Long no : temp) {
            if (temp.contains(no - x)) {
                long b = no - x;
                long outA;
                long outB;
                if (no < 0) {
                    outA = (long)-Math.pow(-no,0.2);
                } else {
                    outA = (long)Math.pow(no,0.2);
                }
                if (b < 0) {
                    outB = (long)-Math.pow(-b,0.2);
                } else {
                    outB = (long)Math.pow(b,0.2);
                }
                System.out.println(outA + " " + outB);
                return;
            }
        }
    }

}