#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
char s[1005],ans[1005];
int div(int chu)
{
int i,sum,k=0;
for(i=0,sum=0;i<strlen(s);i++)
{
sum=sum*10+s[i]-'0';
ans[k++]=sum/chu+'0';
sum%=chu;
}
ans[k]='\0';
if(sum==0)
{
i=0;
while(ans[i]=='0')
i++;
strcpy(s,ans+i);
return 1;
}
return 0;
}
int main()
{
while(~scanf("%s",s))
{
int tmp1[1005];
memset(tmp1,0,sizeof(tmp1));
if(s[0]=='-')
break;
else if(s[0]=='0')
{
printf("10\n");
continue;
}
else if(s[1]=='\0')
{
printf("1%s\n",s);
continue;
}
else
{
int k=0;
for(int i=9;i>1;i--)
{
while(div(i)==1)
{
tmp1[k++]=i;
}
}
sort(tmp1,tmp1+k);
if(s[0]=='1'&&s[1]=='\0')
{
for(int i=0;i<k;i++)
printf("%d",tmp1[i]);
printf("\n");
}
else
printf("There is no such number.\n");
}
}
return 0;
}