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;

namespace Factorization
{
    class Program
    {
        static void Main(string[] args)
        {
            const int FromD = -200;
            const int ToD = 200;

            int ans;
            int PicD = int.Parse(System.Console.ReadLine());
            for(int i = FromD; i < ToD; i++)
            {
                int flg = 0;
                for (int j = FromD; j < ToD; j++)
                {

                        ans = (int)System.Math.Pow(i, 5)-(int)System.Math.Pow(j,5);

                        if (ans == PicD)
                        {
                        System.Console.WriteLine(i.ToString() + " " + j.ToString());
                        flg = 1;
                        break;
                        }
 
                }

                if (flg == 1) break;
            }

           
            
        }
    }
}