#Lutece1741. 连通图计数

连通图计数

Migrated from Lutece 1741 连通图计数

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

求出nn个顶点的联通无向图的个数,顶点有标号,不允许重边和自环.

Input

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

Output

输出nn行,分别表示从11nn时的答案,只需输出其在mod 109+7\text{mod } 10^9 +7意义下的值即可

Samples

3
1
1
4

Resources

Prepared by xiper