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

class Program
{
    static void Main(string[] args)
    {
        var x = long.Parse(Console.ReadLine());

        long b = -1;
        long a = 0;

        var tyaku = GetDivisors(x);

        for (int i = -1; i < x; i++)
        {
            foreach (var item in tyaku)
            {

                a = b + item;
                if (Math.Pow(a, 5) - Math.Pow(b, 5) == x) goto ans;

            }

        }

        ans: 
        Console.WriteLine($"{a} {b}");
    }

    public static IEnumerable<long> GetDivisors(long num)
    {
        if (num < 1) yield break;

        for (long i = 1; i * i <= num; i++)
        {
            if (num % i == 0)
            {
                yield return i;
                if (i * i != num) yield return (num / i);
            }
        }
    }
}