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++ (GCC 9.2.1) (judge verdict: Accepted)

#include <iostream>
#include<stdio.h>
#include<stdlib.h>

int main()
{
  int x;
  long a,b;
  int max_roop = 130;
  bool roop_break = false;
  int i,j;
  
  scanf("%d",&x);
  
  for(a = -max_roop; a <=max_roop; a++)
  {
    for(b = -max_roop; b <=max_roop; b++)
    {
      if((a*a*a*a*a - b*b*b*b*b) == x)
      {
        printf("%d %d\n",a,b);
        roop_break = true;
        break;
      }
    }
    
    if(roop_break)
    {
      break; 
    }
  }
  
  return 0;
}