#include <iostream>
#include <queue>
using namespace std;
void search(int n)
{
    queue<long long> Q;
    Q.push(1);
    while(!Q.empty())
    {
        long long now;
        now=Q.front();
        if(now%n==0) {cout<<now<<endl;return;}
        Q.pop();
        Q.push(now*10);
        Q.push(now*10+1);
    }
}
int main()
{
    int n;
    while(cin>>n&&n)
    {
        search(n);
    }
    return 0;
}