Leo is training his martial arts in byteland's dojo. There is a rectangular (5 × 2n) corridor to join the dojo.

In how many ways W(n) can we exactly cover the corridor with 5n tatamis (2 × 1) ?

Input

There's no input for this task

Output

You should output 17 lines with: W(1), W(2), W(3), ..., W(17)

Example

Output:
8
95
... (15 lines follows)

Score

Score is source length, you have to use less than 190 bytes, the third should be enough.

Information

W(17) fit in a 64bit signed container, W(18) doesn't.

You may try M3TILE or M4TILE first.

After that, you may try those : Tiling a WxH Grid With Dominoes , Corridor I , Corridor II .