import os






def _lowerCamelCase  (		):
							_lowerCAmelCase							=							os.path.join(os.path.dirname(snake_case  )     , 'num.txt'  )
							with open(snake_case  ) as file_hand:
														return str(sum(int(snake_case  ) for line in file_hand  )  )[:10]


if __name__ == "__main__":
				print(solution())







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()






