#include <iostream>
#include <queue>
using namespace std;

int BFS(int n){
  queue<long long> myQueue;
  myQueue.push(1);
  while(!myQueue.empty()){ 
    long long tmp = myQueue.front();
    if((tmp%n)==0)
      return tmp; // 必须要在这里输出
    myQueue.pop();
    myQueue.push(tmp * 10); //(tmp << 3) + 2*tmp
    myQueue.push(tmp * 10 + 1);
  }
  return 0;
}


int main(){
  int n;
  while((cin >> n)&&n){
    cout << BFS(n) << endl;
  }
  return 0;
}