#include<cstdio>
#include<queue>
using namespace std;
typedef long long ll;
//bfs,dfs都可以
int n;
bool f;
void dfs(ll a,int step)
{
    if(f)
        return;
    if(a%n==0)
    {
        printf("%I64d\n",a);
        f = 1;
        return;
    }
    if(step==18)
        return;
    dfs(a*10,step+1);
    dfs(a*10+1,step+1);
}
int main()
{
    while(scanf("%d",&n),n)
    {
        f = false;
        dfs(1,0);
    }
    return 0;
}