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

namespace ABC166
{
    class D
    {
        static void Main(string[] args)
        {
            long X = long.Parse(Console.ReadLine());
            // A- B = 1 とする。
            // A^5 - B^5 = X の時、まずAとBが取りうる範囲を決める。
            /*
            long ans = 0;
            long A = 1;
            long B = 0;
            while (ans < X)
            {
                if (X < Math.Pow(A, 5) - Math.Pow(B, 5))
                {
                    break;
                }
                A++;
                B++;
            }
            */

            for (long i = -120; i < 120; i++)
            {
                for (long j = -120; j < 120; j++)
                {
                    if (X == Math.Pow(i, 5) - Math.Pow(j, 5))
                    {
                        Console.WriteLine("{0} {1}", i, j); return;
                    }

                }
            }
        }
    }
}