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.Text;
using System.Collections.Generic;
using System.Collections;
using static System.Math;
using System.Linq;
using static System.Array;

namespace ConsoleApp2
{
    class Program
    {
    

        static void Main(string[] args)
        {
            var X = long.Parse(Console.ReadLine());
            //var c = Console.ReadLine();
            //var ABN = Console.ReadLine().Split(' ').Select(x => long.Parse(x)).ToArray();
            var A = 0;
            var B = 0;
            var flg = true;
            for (int i = 1; flg && i <= 200; i++)
            {
                for (int j = -200; j <= 200; j++)
                {
                    if(X == (long)(Pow(j, 5) - Pow(j - i, 5)))
                    {
                        A = j;
                        B = j - i;
                        flg = false;
                    }
                }
            }
            Console.WriteLine(A+" "+B);
        }

    }

}