当前没有测试数据。

Description

Your task is to count for k=1,2,…,n the number of ways two knights can be placed on a k×k chessboard so that they do not attack each other.

Input Format

The only input line contains an integer n.

Output Format

Print n integers: the results.

8

0
6
28
96
252
550
1056
1848

Hint

1≤n≤10000

Source

CSES