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.Collections.Generic;
using System.Linq;
using System.Text;

class Program
{
    static void Main(string[] args)
    {
        var X = int.Parse(Console.ReadLine());

        // A^5 < Xの範囲を算出
        long calc = 0;
        var range = 1;
        while(calc < 10000000000000)
        {
            calc = (long)Math.Pow(range, 5);
            range++;
        }

        var A = 0;
        var B = 0;
        for(int i = -range; i < range; i++)
        {
            for(int j = -range; j < range; j++)
            {
                if((long)(Math.Pow(i, 5) - Math.Pow(j, 5)) == X)
                {
                    A = i;
                    B = j;
                }
            }
        }
        Console.WriteLine($"{A} {B}");
    }
}