eolymp
bolt
Try our new interface for solving problems
Problems

Expansion of

Expansion of

Any positive integer can be represented as a sum of several consecutive positive integers. For example, the number \textbf{25} can be represented as the sum of one (\textbf{25}), two (\textbf{12}+\textbf{13}) and five numbers (\textbf{3}+\textbf{4}+\textbf{5}+\textbf{6}+\textbf{7}). Write a program that determines the maximum number of numbers in this expansion. \InputFile In the first line of the input file contains an integer \textbf{N} (\textbf{1}  ≤  \textbf{N}\textit{ } ≤ \textbf{ 10^9}). \OutputFile In the output file output one integer - maximum number of numbers in the expansion of \textbf{N} consecutive positive integers.
Time limit 1 second
Memory limit 64 MiB
Input example #1
25
Output example #1
5