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;

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

            int p = 0;
            var pow = new List<long>();
            for(int i=0; i<100; i++){
                pow.Add((long) Math.Pow(i, 5));
                if(pow[i]<x) p++; 
            }

            for(int i=p+1; 0<=i; i--){
                long d = Math.Abs(pow[i]-x);
                for(int j=0; j<100; j++){
                    if(pow[j]==d){
                        if(pow[i]<x) j *= -1;
                        Console.WriteLine("{0} {1}", i, j);
                        return;
                    }
                }
            }
        }
    }
}