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;

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

            while (true)
            {
                var n = Math.Pow(a, 5) - X;
                Func<long, double> f = s => Math.Pow(s, 5) - Math.Abs(n);
                var b = SearchLast(s => f(s) <= 0, 0, Math.Max(a, 46));

                if (f(b) == 0)
                {
                    if (n < 0) b = -b;
                    Console.WriteLine(string.Format("{0} {1}", a, b));
                    return;
                }
                a++;
            }
        }

        public static long SearchLast(Func<long, bool> f, long min, long max)
        {
            if (f(max)) return max;
            var k = min + (max - min) / 2;

            return f(k) ? SearchLast(f, k, max - 1) : SearchLast(f, min, k);
        }
    }
}