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.io.*;
import java.util.*;

class Main
{
    public static void main(String args[])throws Exception
    {
        BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));
        long n=Long.parseLong(bu.readLine()),i,j,a=0,b=0;
        int f1=0,f2=0;
        for(i=0;i<=70;i++)
        {
            for(j=0;j<=i;j++)
                if((long)(Math.pow(i,5)-Math.pow(j,5))==n) {a=i; b=j; f1=1; break;}
                else if((long)(Math.pow(i,5)+Math.pow(j,5))==n) {a=i; b=j; f2=1; break;}
            if(f1==1 || f2==1) break;
        }
        if(f2==1) b=-b;
        System.out.print(a+" "+b);
    }
}