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-csc 3.5.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static void Main(string[] args)
    {
        Console.WriteLine(Main2());
    }

    static string Main2()
    {
        var X = long.Parse(Console.ReadLine());
        var sum = new long[10000];

        for (var i = 1; i < 10000; i++)
        {
            sum[i] = i * i * i * i * i;
        }

        for (var x = 0; x < 10000; x++)
        {
            for (var y = 0; y < 10000; y++)
            {
                if (+sum[x] - sum[y] == X) 
                    return "" + x + " " + y;
                if (+sum[x] + sum[y] == X) 
                    return "" + x + " -" + y;
                if (-sum[x] - sum[y] == X) 
                    return "-" + x + " " + y;
                if (-sum[x] + sum[y] == X) 
                    return "-" + x + " -" + y;
            }
        }

        return null;
    }
}