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

import java.io.*;
import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

        long X = scan.nextInt();

        long A = 0;
        long b;

        while (true) {
        	long Bfive = A*A*A*A*A - X;

        	if (Bfive < 0) {
        		b = -1;
        		while (b*b*b*b*b > Bfive) {
        			b--;
        		}
        		if (b*b*b*b*b == Bfive) {
        			break;
        		}

        	} else if (Bfive > 0) {
        		b = 1;
        		while (b*b*b*b*b < Bfive) {
        			b++;
        		}
        		if (b*b*b*b*b == Bfive) {
        			break;
        		}

        	} else if (Bfive == 0) {
        		b = 0;
        		break;
        	}

        	A++;
        }

		System.out.println(A+" "+b);

	}
}