def _lowerCamelCase  (		snake_case  ):
							assert (
							    isinstance(snake_case     , snake_case  ) and number_of_steps > 0
							), F'number_of_steps needs to be positive integer, your input {number_of_steps}'
							if number_of_steps == 1:
														return 1
							_lowerCAmelCase			,		_lowerCAmelCase							=							1, 1
							for _ in range(number_of_steps - 1  ):
														_lowerCAmelCase			,		_lowerCAmelCase							=							current + previous, current
							return current


if __name__ == "__main__":
				import doctest

				doctest.testmod()







def _lowerCamelCase  (		snake_case = 10  ):
							if not isinstance(snake_case     , snake_case  ) or n < 0:
														raise ValueError('Invalid input'  )
							_lowerCAmelCase							=							10**n
							_lowerCAmelCase							=							28_433 * (pow(2     , 7_830_457     , snake_case  )) + 1
							return str(number % modulus  )


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

				testmod()
				print(f"""{solution(1_0) = }""")






