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;

namespace ABC166D
{
    class Program
    {
        static void Main(string[] args)
        {
            long N = long.Parse(Console.ReadLine());
            long p = 0;

//            long rtN = (long) Math.Ceiling(Math.Sqrt(N));
            long rtN = 1000;
            long a = 0;
            long b = 0;
            if(N == 1) {
                Console.WriteLine("1 0");
                return;
            }
            for(long j=2; j<rtN; j++){
                if(N % j == 0) {
                    long q = N / j; p = j;
                    Boolean f = false;
                    for(long i=-rtN;i<rtN;i++){
                        a = p+i;
                        if(q == i*i*i*i + i*i*i*a + i*i*a*a + i*a*a*a + a*a*a*a){
                            b = i; f = true; break;
                        }
                    }
                    if(f) break;                    
                }               
            }
            Console.WriteLine("{0} {1}", a, b);
//            Console.WriteLine("{0}", a*a*a*a*a - b*b*b*b*b);
        }
    }
}