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

namespace ProblemD
{
    class Program
    {
        static void Main(string[] args)
        {
            var x = long.Parse(Console.ReadLine());
            var memo = new Dictionary<long, long>();
            bool find = false;
            for(long i = 1; i< 101;i++)
            {
                if (!memo.ContainsKey(i))
                    memo[i] = i * i * i * i * i;
                var a = memo[i];
                for (long j = -100; j < i; j++)
                {
                    if (!memo.ContainsKey(j))
                        memo[j] = j * j * j * j * j;

                    if (x == a - memo[j])
                    {
                        Console.WriteLine(i + " " + j);
                        find = true;
                        break;
                    }
                }
                if (find) break;

            }
        }
    }
}