The Segments#46
Cut a segment of length into the largest possible number of parts with positive integer lengths, such that it is impossible to form a triangle from any three of these parts.
The length of the segment is (4 \le L \le 2 \cdot 10^9).
Output the required number of parts.
Example 1