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

namespace D_ABC166
{
    class MainClass
    {

        static long[] s;

        public static void Main(string[] args)
        {
            s = Array.ConvertAll(ReadLine().Split().ToArray(), long.Parse);
            long[] a = new long[1001];
            long[] b = new long[1001];

            for(int i = 0;i<=1000;i++){
                long tmp = (long)Pow(i,5);
                a[i] = tmp;
                b[i] = -tmp;
            }

            for(int i = 0;i<=1000;i++){
                for(int j = 0;j<=1000;j++){
                    long tmp = a[i] + b[j];
                    long tmp2 = a[i] - b[j];
                    if(tmp ==s[0]){
                        WriteLine("{0} {1}",i,j);
                        return;
                    }else if(tmp2==s[0]){
                        WriteLine("{0} {1}",i,-(j));
                        return;
                    }
                }
            }
        }
    }
}