ENG  RUS Timus Online Judge
Online Judge
Problems
Authors
Online contests
Site news
Webboard
Problem set
Submit solution
Judge status
Guide
Register
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules

Contest is over

## A. Heritage

Time limit: 2.0 second
Memory limit: 64 MB
Your rich uncle died recently, and the heritage needs to be divided among your relatives and the church (your uncle insisted in his will that the church must get something). There are N relatives (N ≤ 18) that were mentioned in the will. They are sorted in descending order according to their importance (the first one is the most important). Since you are the computer scientist in the family, your relatives asked you to help them. They need help, because there are some blanks in the will left to be filled. Here is how the will looks:
`Relative #1 will get 1/... of the whole heritage,`
`Relative #2 will get 1/... of the whole heritage,`
`...`
`Relative #N will get 1/... of the whole heritage.`
The logical desire of the relatives is to fill the blanks in such way that the uncle’s will is preserved (i.e the fractions are non-ascending and the church gets something) and the amount of heritage left for the church is minimized.

### Input

The only line of input contains the single integer N (1 ≤ N ≤ 18).

### Output

Output the numbers that the blanks need to be filled (on separate lines), so that the heritage left for the church is minimized.

### Sample

inputoutput
```2
```
```2
3
```
Problem Author: Pavlin Peev
To submit the solution for this problem go to the Problem set: 1108. Heritage