#include <iostream> using namespace std; __int64 q[1100000]; int n; __int64 bfs() { int front = 0, rear = 0; q[rear++] = 1; while(front < rear) { __int64 temp = q[front++]; if(temp % n == 0) return temp; temp *= 10; q[rear++] = temp; q[rear++] = temp+1; } } int main() { while(cin >> n && n) printf("%I64d/n",bfs()); return 0; } //思想: //每个数(只含0,1的数)增加位数时,有两种加法,尾部加0 or 加1 //如1 -> 10 11 , 如10 ->100 101 11->110 111 //因此可以找出所有含0,1的数 //很经典的bfs