Time limit: 0.2s
Memory limit: 64MB
Input:
Output:

## Task

You are given an integer $n$. Print a number with $n$ digits in base $10$ such that it is only made of digits $0$ and $1$ and it is a multiple of $n$.

As an example, if $n = 6$, $101100$ is one such number.

## Input data

The first line contains $n$, the number of digits of the number we need to find.

## Output data

The first line will contain an integer with $n$ digits, representing the required answer. Any correct solution is accepted, as long as the number respects the rules given above.

## Constraints and clarifications

- $1 \leq n \leq 1 \ 000 \ 000$;
- For tests worth $24$ points, $n \leq 10 \ 000$.

## Example

`stdin`

```
8
```

`stdout`

```
10110000
```

### Explanation

$\frac{10110000}{8} = 1263750$