eolymp
bolt
Try our new interface for solving problems
Problems

The Segments

The Segments

Cut a segment with length \textbf{L} on the most quantity of parts the lengths of which are natural numbers, that from them it is not impossible to make a single triangle. \textbf{Input } The length of the segment \textbf{L}. \textbf{4} <= \textbf{L} <= \textbf{2000000000}. \textbf{Output} The required number of parts.
Time limit 1 second
Memory limit 128 MiB
Input example #1
6
Output example #1
3