4
|
3
Code:

#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <cstdio>
#include <string>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>

#define x first
#define y second

//#define int long long

using namespace std;

//typedef int long long;
typedef pair<int,int>PII;

const int maxn = 2e5 + 10;

int t,n,m;


int main(void) {
	scanf("%d",&n);
	for(int i = -120; i <= 120; i ++) {
		for(int j = -120; j <= 120; j ++) {
			if(pow(i,5) - pow(j,5) == n) {
				printf("%d %d\n",i,j);
				return 0;
			}
		}
	}
	return 0;	
} 