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# (Mono-mcs 6.8.0.105) (judge verdict: Accepted)

using System;

namespace ABC166D
{
    class Program
    {
        static void Main(string[] args)
        {

            var X = int.Parse(Console.ReadLine());

            int max = 1000;
            long[] fives = new long[2 * max + 1];

            for (int i = -max; i <= max; i++)
            {
                int index = i + max;
                fives[index] = (long)Math.Pow(i, 5);
            }

            int ansa = 0;
            int ansb = 0;
            for (int i = 0; i < fives.Length; i++)
            {
                for (int j = 0; j < fives.Length; j++)
                {
                    if (i == j) continue;
                    long a = fives[i];
                    long b = fives[j];
                    if (a - b == X)
                    {
                        ansa = i - max;
                        ansb = j - max;
                    }
                }
            }

            Console.WriteLine(ansa + " " + ansb);
            Console.ReadKey();
        }



    }
}