As an experiment the Educational Codeforces Round 33 will be rated for Div. 2.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

The following languages are only available languages for the problems from the contest

Surprise Language Round #5:

- OpenCobol 1.0

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Binary notation

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given a positive integer *n*. Output its binary notation.

Input

The only line of input data contains an integer *n* (1 ≤ *n* ≤ 10^{6}).

Output

Output the binary notation of *n* (without any leading zeros).

Examples

Input

5

Output

101

Input

13

Output

1101

Note

In the first example 5 = 1 * 2^{2} + 0 * 2^{1} + 1 * 2^{0}.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/23/2017 15:49:29 (c4).

Desktop version, switch to mobile version.

User lists

Name |
---|