Special Judge

Problem Description

Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corresponding m containing no more than 100 decimal digits.

Input

The input file may contain multiple test cases. Each line contains a value of n (1 <= n <= 200). A line containing a zero terminates the input.

Output

For each value of n in the input print a line containing the corresponding value of m. The decimal representation of m must not contain more than 100 digits. If there are multiple solutions for a given value of n, any one of them is acceptable.

Sample Input

2

6

19

0

Sample Output

10

100100100100100100

111111111111111111

代码：

#include <iostream>
#include <queue>
#include <stdio.h>
using namespace std;
int main()
{
    int n,ans;
    while(scanf("%d",&n) && n)
    {
        ans=1;
        queue<long long>q;
        q.push(ans);
        while(!q.empty())
        {
            long long  sum=q.front();
            q.pop();
            if(sum%n==0)
            {
                cout<<sum<<endl;
                break;
            }
            else
            {
                q.push(sum*10);
                q.push(sum*10+1);
            }
        }
    }
    return 0;
}