


def 						lowerCamelCase(   a__):
				_SCREAMING_SNAKE_CASE			  =int(a__)
				if decimal in (0, 1):  # Exit cases for the recursion
								return str(a__)
				_SCREAMING_SNAKE_CASE  ,				_SCREAMING_SNAKE_CASE			  =divmod(a__	,2)
				return binary_recursive(a__) + str(a__)







def 						lowerCamelCase(   a__):
				_SCREAMING_SNAKE_CASE			  =str(a__).strip()
				if not number:
								raise ValueError('''No input value was provided''')
				_SCREAMING_SNAKE_CASE			  ='''-''' if number.startswith('''-''') else ''''''
				_SCREAMING_SNAKE_CASE			  =number.lstrip('''-''')
				if not number.isnumeric():
								raise ValueError('''Input value is not an integer''')
				return f"{negative}0b{binary_recursive(int(a__))}"


if __name__ == "__main__":
							from doctest import testmod

							testmod()



from collections.abc import Generator







def 						lowerCamelCase(   ):
				_SCREAMING_SNAKE_CASE  ,				_SCREAMING_SNAKE_CASE			  =0, 1
				while True:
								_SCREAMING_SNAKE_CASE  ,				_SCREAMING_SNAKE_CASE			  =b, a + b
								yield b







def 						lowerCamelCase(   a__ = 1000):
				_SCREAMING_SNAKE_CASE			  =1
				_SCREAMING_SNAKE_CASE			  =fibonacci_generator()
				while len(str(next(a__))) < n:
								answer += 1
				return answer + 1


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