

from collections.abc import Generator



def    __UpperCAmelCase (	)			->     Generator[int, None, None]:

					"""simple docstring"""

					_a      ,					_a	:    Any         =		0, 1
					while True:
										_a      ,					_a	:    List[str]         =		b, a + b
										yield b



def    __UpperCAmelCase (	__a      :			int = 1_000	)			->     int:

					"""simple docstring"""

					_a	:    Union[str, Any]         =		1
					_a	:    Tuple         =		fibonacci_generator()
					while len(str(next(__a	)	)	) < n:
										answer += 1
					return answer + 1


if __name__ == "__main__":
			print(solution(int(str(input()).strip())))






def    __UpperCAmelCase (	__a      :			float	)			->     float:

					"""simple docstring"""

					return 10 - x * x



def    __UpperCAmelCase (	__a      :			float		,__a      :			float	)			->     float:

					"""simple docstring"""

					if equation(__a	) * equation(__a	) >= 0:
										raise ValueError('''Wrong space!'''	)

					_a	:    Dict         =		a
					while (b - a) >= 0.01:
										# Find middle point
										_a	:    Any         =		(a + b) / 2
										# Check if middle point is root
										if equation(__a	) == 0.0:
															break
										# Decide the side to repeat the steps
										if equation(__a	) * equation(__a	) < 0:
															_a	:    str         =		c
										else:
															_a	:    Union[str, Any]         =		c
					return c


if __name__ == "__main__":
			import doctest

			doctest.testmod()

			print(bisection(-2, 5))
			print(bisection(0, 6))



