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: Time Limit Exceeded)

using System;

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

            int A = 0;
            int B = 0;
            if (X == 0)
            {
                Console.WriteLine("0 0");
                return;
            }

            while (Math.Abs(X - Power5(A)) > Math.Abs(X - Power5(A + 1)))
            {
                A = X > 0 ? ++A : --A;
            }
            int Y = X - Power5(A);
            while(0 != Math.Abs(Y + Power5(B)))
            {
                B = Y > 0 ? --B : ++B;
            }

            Console.WriteLine("{0} {1}", A, B);
        }

        static int Power5(int n)
        {
            return n * n * n * n * n;
        }
    }

    
}