



from __future__ import annotations







def snake_case__  (			__SCREAMING_SNAKE_CASE			,     __SCREAMING_SNAKE_CASE )		->							bool:
			if len(lowerCamelCase__ ) == 0:
						return False
			UpperCAmelCase_						=				len(lowerCamelCase__ ) // 2
			if a_list[midpoint] == item:
						return True
			if item < a_list[midpoint]:
						return binary_search(a_list[:midpoint]			,     lowerCamelCase__ )
			else:
						return binary_search(a_list[midpoint + 1 :]			,     lowerCamelCase__ )


if __name__ == "__main__":
			SCREAMING_SNAKE_CASE     				=						input("Enter numbers separated by comma:\n").strip()
			SCREAMING_SNAKE_CASE     				=						[int(item.strip()) for item in user_input.split(",")]
			SCREAMING_SNAKE_CASE     				=						int(input("Enter the number to be found in the list:\n").strip())
			SCREAMING_SNAKE_CASE     				=						"" if binary_search(sequence, target) else "not "
			print(f'''{target} was {not_str}found in {sequence}''')






def snake_case__  (			__SCREAMING_SNAKE_CASE )		->							int:
		UpperCAmelCase_						=				1
		for i in range(1			,     num + 1 ):
				fact *= i
		return fact







def snake_case__  (			__SCREAMING_SNAKE_CASE )		->							int:
		UpperCAmelCase_						=				0
		while number > 0:
				UpperCAmelCase_						=				number % 10
				sum_of_digits += last_digit
				UpperCAmelCase_						=				number // 10  # Removing the last_digit from the given number
		return sum_of_digits







def snake_case__  (			__SCREAMING_SNAKE_CASE = 100 )		->							int:
		UpperCAmelCase_						=				factorial(__SCREAMING_SNAKE_CASE )
		UpperCAmelCase_						=				split_and_add(__SCREAMING_SNAKE_CASE )
		return result


if __name__ == "__main__":
			print(solution(int(input("Enter the Number: ").strip())))

