Find the number of ways to cover a rectangle $2 \cdot n$ with domino of size $2 \cdot 1$. The coverings that turn themselves into symmetries are considered different. \InputFile One integer $n~(0 < n < 65536)$. \OutputFile Print the number of coverings of rectangle.