eolymp
bolt
Try our new interface for solving problems
Problems

Pieces - 2

Pieces - 2

Time limit 1 second
Memory limit 64 MiB

The segment length L is cut into the largest number of units of length - the natural numbers, of which it is impossible to lay down a single triangle. Find the number of possible options for cutting. (Two cutting are different, if ordered arrays of lengths of their parts differ by at least one element).

Input data

The value of L (4 <= L <= 200).

Output data

The only number - the number of options for cutting.

Examples

Input example #1
11
Output example #1
4