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.
One integer n~(0 < n < 65536).
Print the number of ways to tile the rectangle with dominoes.
Example 1
Example 2