| Surprise Language Round 6 |
|---|
| Finished |
You are given a positive integer n. Output its binary notation.
The only line of input data contains an integer n (1 ≤ n ≤ 106).
Output the binary notation of n (without any leading zeros).
5
101
101
1100101
In the first example 5 = 1 * 22 + 0 * 21 + 1 * 20.
| Name |
|---|


