
from collections.abc import Generator


def    A (      )     ->						Generator[int, None, None]:
		'''simple docstring'''

		UpperCamelCase			,						UpperCamelCase						=  0, 1
		while True:
				UpperCamelCase			,						UpperCamelCase						=  b, a + b
				yield b


def    A (      lowercase = 1_000				)     ->						int:
		'''simple docstring'''

		UpperCamelCase						=  1
		UpperCamelCase						=  fibonacci_generator()
		while len(str(next(lowercase				)				)				) < n:
				answer += 1
		return answer + 1


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


def    A (      lowercase					, lowercase				)     ->						str:
		'''simple docstring'''

		if a < 0 or b < 0:
				raise ValueError('the value of both inputs must be positive'				)

		UpperCamelCase						=  str(bin(lowercase				)				)[2:]  # remove the leading "0b"
		UpperCamelCase						=  str(bin(lowercase				)				)[2:]  # remove the leading "0b"

		UpperCamelCase						=  max(len(lowercase				)					, len(lowercase				)				)

		return "0b" + "".join(
		    str(int(char_a != char_b				)				)
		    for char_a, char_b in zip(a_binary.zfill(lowercase				)					, b_binary.zfill(lowercase				)				)				)


if __name__ == "__main__":
					import doctest

					doctest.testmod()
