Danger of explosion#2707

Danger of explosion

1 second
64 megabytes
Very easy

On one of the secret plants, radioactive materials are processed, resulting in radioactive waste of two types: type A (very dangerous) and type B (non-hazardous). All waste is packed in special rectangular containers of equal size, after which the containers are stacked in a pile on top of each other for storage. A stack is explosive if there are two adjacent containers of waste type A. It is required to write a program that counts the number of possible ways to form a non-explosive stack of a given total number of containers .

Input

The input file contains a single integer (1 \leq N \leq 100).

Output

The output file must contain the required number of options.

Examples

Example 1

Loading
Loading