#include<iostream>
#include<queue>
#include<cstring>
#define ll long long
using namespace std;
ll n,m;
//queue<ll> q;
ll q[5000005],f=1,e=1;
void bfs()
{
	while(1){
		if(q[f]%n==0){
			m=q[f];
			break;
		}
		e++;q[e]=10*q[f];
		e++;q[e]=10*q[f]+1;
		f++;
	}
}
int main()
{
	while(cin>>n&&n){
		q[1]=1;
		bfs();
		cout<<m<<endl;
		memset(q,0,sizeof(q));
		f=1,e=1;
	}
	/*
	for(n=1;n<=200;n++)
	{
		q[1]=1;
		bfs();
		printf("n=%d,m=%d\n",n,m);
		memset(q,0,sizeof(q));
		f=1,e=1;
	}
	*/
	return 0;
}