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;
using System.Collections.Generic;
using System.IO;
using System.Linq;

namespace AtCoder
{
	public class ABC
	{
		static public void Main(string[] args)
		{
			Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
			Solve(args);
			Console.Out.Flush();
		}

		private const int mod = 1000000007;  // 10^9+7

		static public void Solve(string[] args)
		{
			//string s = Console.ReadLine();
			//int x = int.Parse(Console.ReadLine());
			long x = long.Parse(Console.ReadLine());
			//int[] vs = Console.ReadLine().Split().Select(int.Parse).ToArray();
			//long[] vs = Console.ReadLine().Split().Select(long.Parse).ToArray();

			for (long i = 0; i < 1000; i++) {
				for (long j = 0; j < 1000; j++) {
					if (i * i * i * i * i - j * j * j * j * j == x) {
						//System.Diagnostics.Debug.WriteLine($"{i * i * i * i * i - j * j * j * j * j} = {i}^5 - {j}^5");
						Console.WriteLine($"{i} {j}");
						return;
					}
					if (i * i * i * i * i - -j * -j * -j * -j * -j == x) {
						//System.Diagnostics.Debug.WriteLine($"{i * i * i * i * i - -j * -j * -j * -j * -j} = {i}^5 - {-j}^5");
						Console.WriteLine($"{i} {-j}");
						return;
					}
				}
			}

		}

	}
}