#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a,i[900],u=0,k,m,b;
	for(a=100;a<=900;a++){
		k=(a%10)*(a%10)*(a%10);
		m=(a%100/10)*(a%100/10)*(a%100/10);
		b=(a/100)*(a/100)*(a/100);
		if(a==k+m+b){
			i[u]=a;
			u++;	
		}
	}
	for(k=1;k<u;k++){
		for(a=1;a<u-k;a++){
			if(i[a]<i[a-1])
			swap(i[a],i[a-1]);
		}
	}
	for(a=0;a<u;a++){
		cout<<i[a]<<endl;
	} 
	return 0;
}
/**************************************************************
	Problem: 1058
	User: houshanglin
	Language: C++
	Result: Accepted
	Time:9 ms
	Memory:2072 kb
****************************************************************/