#include <iostream>
#include <cmath>
#include <vector>

using namespace std;

int n[5] = {0};
const int N = 150;

void Pow(long long int *P){
	for(int i = 1; i <= N; i++){
		P[i-1] = pow(i,5);
	}
}

int * Eu(int be, int en, long long int *P, int *n, int j){
    for (int i = be; i < en; ++i){
        if (n[4] == 0) return n;
        P[N] += P[i]; n[j] = i;
        if (i < 3)
			n = Eu(i, en, P, n, j + 1);
        else {
            size_t k = lround(pow(P[i], 0.2));
            if (P[k] == P[N]) n[4] = k;
        }
        P[N] -= P[i];
    }
    return n;
}

int * Eu(long long int *P, int en){
	n[4] = 0;
	return Eu(1, en, P, n, 0);
}

int main(){
	long long int P[N+1];
	Pow(P);	
	int en;
	cin >> en;
	
	Eu(P, en);
	
	for (int i =0; i < 5; i++)
		cout << n[i] << " ";
	return 0;
}