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

namespace ConsoleApp1
{
    class Program
    {
        static int sqrt5X;
        static int sqrt5x_X_sqrt5X;
        static int X;
        static void Main(string[] args)
        {
            X = int.Parse(Console.ReadLine());
            sqrt5X = (int)Math.Pow(X, 1.0 / 5.0);
            int X_sqrt5X =  X - (int)Math.Pow(sqrt5X, 5);
            sqrt5x_X_sqrt5X = 0;
            if (X_sqrt5X >= 0)
            {
                sqrt5x_X_sqrt5X = -(int)Math.Pow(X_sqrt5X, 1.0 / 5.0);
            }
            else
            {
                sqrt5x_X_sqrt5X = (int)Math.Pow(-X_sqrt5X, 1.0 / 5.0);
            }
            if (!Check())
            {
                sqrt5x_X_sqrt5X = - (int)Math.Pow(X, 1.0 / 5.0);
                sqrt5X = (int)Math.Pow(X - sqrt5x_X_sqrt5X, 1.0 / 5.0);
            }

            Console.WriteLine(sqrt5X + " " + sqrt5x_X_sqrt5X);
        }

        static bool Check()
        {
            if ((int)Math.Pow(sqrt5X, 5) + (int)Math.Pow(sqrt5x_X_sqrt5X, 5) == X)
            {
                return true;
            }
            else
            {
                return false;
            }
        }
    }
}