UVA725Division

//UVA725Division
#include<cstdio>
#include<cstdlib>
#include<cstring>
//#define LOCAL
int main() {
	int n;
	#ifdef LOCAL
	freopen("UVA725in.txt", "r", stdin);
	freopen("UVA725out.txt", "w", stdout);
	#endif
	int cnt = 0;
	while(scanf("%d", &n) == 1 && n) {
	    if(cnt++) printf("\n");
	    int flag = 1;
	    int k = 0;
		for(k = 1234; k < 1e5; k++) {
	    	int tmp = k * n;
	    	char s[100] = {0};
	    	if(k >= 1e4){ 
			    sprintf(s, "%d%d", tmp, k);//将数字转化为字符串 
	    	    /*printf("s = %s\n", s);*/}
			else sprintf(s, "%d0%d", tmp, k);
	    	//printf("s = %s\n", s);
			int len = strlen(s);
	    	int a[20] = {0};
			if(len > 10){ 
			    //printf("s = %s\n", s);
			    break;//退出标志 
			}memset(a, 0, sizeof(a));
			int l = 0;
	    	for(l = 0; l < len; l++) {
			    a[s[l] - '0'] = 1;
	        //    printf("a[%d] = %d\n", s[l] - '0', a[s[l] - '0']);
			}
			for(l = 0; l < 10; l++) if(!a[l]){
			     //printf("k = %d, a[%d] = %d\n", k, l, a[l]);
				 break;
			}
	    	if(l == 10) {
			    flag = 0;
			    if(k > 1e4) printf("%d / %d = %d\n", tmp, k, n);
			    else printf("%d / 0%d = %d\n", tmp, k, n);
	        }
		}
		if(flag) printf("There are no solutions for %d.\n", n);
    } 
	return 0;
}