Pieces - 2#154
A segment of length is cut into the maximum possible number of pieces, each with a positive integer length, so that it is impossible to form a triangle from any three of these pieces. Find the number of different ways to make such a cut. (Two cuts are considered different if the ordered sequences of their piece lengths differ in at least one position).
The value of (4 \leq L \leq 200).
Output a single integer — the number of ways to make the cut.
Example 1