> //换long long 不然就会错
> #include <iostream>
> #include <cstdio>
> #include <cstring>
> #include <queue>
> using namespace std;
> #define ll long long
> int cnt = 0;
> queue<ll>q;
> void bfs(int n)
> {
> 	while(!q.empty()){
> 		ll ptr = q.front(),p;
> 		q.pop();
> 		if(ptr % n == 0){
> 			printf("%lld\n",ptr);
> 			return ;
> 		}
> 		for(int i = 0;i < 2;i++){
> 			if(i == 0){
> 				p = ptr*10+1;
> 				q.push(p);
> 			}
> 			else{
> 				p = ptr*10;
> 				q.push(p);
> 			}
> 		}
> 	}
> }
> int main()
> {
> 	int n;
> 	while(~scanf("%d",&n) && n){
> 		while(!q.empty()){
> 			q.pop();
> 		}
> 		q.push(1);
> 		bfs(n);
> 	}
> 	return 0;
> }
> //害的我半天不敢下手，想出了4种转移状态，每一位变化1或者0，尾部+1或者尾部+0