#include<cstring>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstdlib>
using namespace std;
unsigned long long calu(int x,int lun)
{
	unsigned long long ans=0;
	while(x>0)
	{
		ans+=(unsigned long long)(pow(double(x%10),double(lun)));
		x/=10;
	}
	return ans;
}
int cmp(const void *a,const void *b)
{
	return *(int *)a - *(int *)b;
}
int main()
{
	freopen("ghillie.in","r",stdin);
	freopen("ghillie.out","w",stdout);
	int n,i=0,j,k,len;
	int num[201];
	unsigned long long ber[201];
	memset(num,0,sizeof(num));
	scanf("%d\n",&n);
	while(scanf("%d",&num[i])!=-1)
		i++;
	len=i;
	for(i=2;i<=n+1;i++)
	{
		for(j=0;j<len;j++)
		{
			if(num[j]!=-1)
				ber[j]=calu(num[j],i);
		}
		for(j=0;j<len;j++)
		{
			for(k=0;k<len;k++)
			{
				if((unsigned long long)(num[j])==ber[k]&&num[j]!=-1)
					num[j]=-1;
			}
		}
	}
	qsort(num,len,sizeof(int),cmp);
	for(i=0;i<len;i++)
	{
		if(num[i]!=-1)
		{
			printf("%d ",num[i]);
		}
	}
	fclose(stdin);
	fclose(stdout);
	return (0);
}