Code Submission Evaluation System Login

CSES Problem Set

Two Knights


Task | Statistics


CSES - Two Knights

Time limit:1.00 s Memory limit:512 MB

Your task is to count, for $k=1,2,\ldots,n$, the number ways two knights can be placed on an $k \times k$ chessboard so that they do not attack each other.

Input

The only input line contains an integer $n$.

Output

Print $n$ integers: the results.

Constraints
Example

Input:
8

Output:
0
6
28
96
252
550
1056
1848