Domino#4469

Domino

1 second
256 megabytes
Very easy

Find the number of ways to completely tile a rectangle of size 2 \times n with dominoes of size 2 \times 1. Coverings that coincide with themselves under symmetries (rotations or reflections) are considered different.

Input

One integer n~(0 < n < 65536).

Output

Print the number of ways to tile the rectangle with dominoes.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading