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: Wrong Answer)

using System;

class Program
{
    static void Main () 
    {
        String[] inline = Console.ReadLine().Split(' ');
        long x = long.Parse(inline[0]);

        long a = -100;
        long b = -100;
        for(long i = a; i < 100; i++)
        {
            for(long j  = b; j < 100; j++)
            {
                long y = (long) (Math.Pow(i,5) - Math.Pow(j,5));
                if(x == y)
                {
                    Console.WriteLine("{0} {1}", i, j);
                    Environment.Exit(0);
                }
            }
        }
        Console.WriteLine("none");
    }
}