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;

class Program
{
	static void Main(string[] args)
	{
		Int64 i, j;

		int x = int.Parse(Console.ReadLine());

		for (i = -128; i <= 128; i++)
		{
			for (j = -128; j <= 128; j++)
			{
				if(i*i*i*i*i - j*j*j*j*j == x)
				{
					Console.WriteLine(i + " " + j);
					return;
				}
			}
		}

		return;
	}
}