Migrated from Lutece 1739 Bernoulli数

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

对于所有的$0 \leq i \leq n-1$，输出$B_i$

Input

输入只有一个数$n$.($1 \leq n \leq 10^5$)

Output

输出$n$行，第$i$行表示$B_i$，只需输出其在$\text{mod } 10^9 +7$意义下的值即可

Samples

2

1
500000003

Resources

Prepared by xiper