In the event of technical difficulties with Szkopuł, please contact us via email at szkopul@fri.edu.pl.

If you are familiar with IRC chat, the support team is also reachable on PIRC network (`irc.pirc.pl`

) in `#szkopul`

channel. If you are not, just use email.

Please do not ask us things like "how to solve task XYZ?".

Please remember that the support team has to sleep sometimes or go to work in real life.

Certain positive integers have their decimal representation consisting only of
ones and zeros, and having at least one digit one, e.g. `101`. If a
positive integer has not such a property, one can try to multiply it by some
positive integer to find out whether the product has this property.

Write a program which:

- reads from the standard input positive integers not greater than ,
- for each integer read computes a correct answer,
- writes the answer to the standard output.

The standard input contains in the first line a positive integer . In consecutive lines there is a sequence of numbers in the range of [], one number per line. The numbers in the standard input are written correctly, and your program need not verify that.

Each line of the standard output, starting with the first, should contain:

- either only one word
`BRAK`, - or exactly one positive integer being a multiple of a successive number given in the input; each multiple must be a number composed only of digits and , and has to be written with no spaces between the digits.

For the input data:

6 17 11011 17 999 125 173

the correct result is:

11101 11011 11101 111111111111111111111111111 1000 1011001101

*Task author: Andrzej Walat.*