Find The Multiple

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<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<stack>
#include<queue>
using namespace std;
stack <char> s;


int n;
int m;
void dfs(long long a, int b)
{
    if (m || b > 18)\\循环次数不能超过18，m是记录当输出a时返回所有的函数的条件
        return ;
    if (a % n == 0)
    {
        m = 1;
        printf("%lld\n", a);
        return ;
    }
        dfs(a * 10, b + 1);
        dfs(a * 10 + 1, b + 1);

}
int main()
{
    while(~scanf("%d", &n) && n)
    {
        m = 0;
        dfs(1, 0);

    }
    return 0;
}