Find The Multiple poj1426

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int n;
void bfs()
{
queue<long long> q;
q.push(1);
while(!q.empty())
{
long long x=q.front();
q.pop();
if(x%n==0)
{
printf("%lld\n",x);
return;
}
q.push(10*x);
q.push(10*x+1);
}
}
int main()
{
while(~scanf("%d",&n))
{
if(n==0) break;
bfs();
}
return 0;
}