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 C# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Linq;

class program
{
    static void Main()
    {
        var x = int.Parse(Console.ReadLine());
        for(int i = -199; i < 120; i++)
        {
            for(int j = -199; j < 120; j++)
            {
                if((long)Math.Pow(i,5) - (long)Math.Pow(j, 5) == x)
                {
                    Console.Write(i + " " + j);
                    return;
                }
            }
        }
    }
}