#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
struct node{
int a,b;
};
vector<node> ans[80];
int main()
{
int a[10] = {0,1,2,3,4,5,6,7,8,9};
do{
int num1 = 0,num2= 0;
for(int i = 0;i < 5 ;i ++) num1 = num1 * 10 + a[i];
for(int i = 5;i < 10;i ++) num2 = num2 * 10 + a[i];
if(num1%num2==0&&num1/num2 >= 2 && num1/num2<=79) {
ans[num1/num2].push_back({num1,num2});
}
}while(next_permutation(a,a+10));
int n,k = 0;
while(cin>>n&&n){
if(k++)cout<<endl;
if(ans[n].size())
for(int i = 0; i <= ans[n].size()-1;i ++){
printf("%05d / %05d = %d\n",ans[n][i].a,ans[n][i].b,n);
}
else{
printf("There are no solutions for %d.\n",n);
}
}
return 0;
}