
from __future__ import annotations







def      snake_case		(							UpperCAmelCase	:       list[int],						UpperCAmelCase	:       int   ):
				if len(UpperCAmelCase   ) == 0:
								return False
				A	 =      len(UpperCAmelCase   ) // 2
				if a_list[midpoint] == item:
								return True
				if item < a_list[midpoint]:
								return binary_search(a_list[:midpoint],						UpperCAmelCase   )
				else:
								return binary_search(a_list[midpoint + 1 :],						UpperCAmelCase   )


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













from itertools import permutations







def      snake_case		(							UpperCAmelCase	:       tuple   ):
				if num[3] % 2 != 0:
								return False

				if (num[2] + num[3] + num[4]) % 3 != 0:
								return False

				if num[5] % 5 != 0:
								return False

				A	 =      [7, 11, 13, 17]
				for i, test in enumerate(UpperCAmelCase   ):
								if (num[i + 4] * 1_00 + num[i + 5] * 10 + num[i + 6]) % test != 0:
												return False
				return True







def      snake_case		(							UpperCAmelCase	:       int = 10   ):
				return sum(
				    int(''.join(map(UpperCAmelCase,						UpperCAmelCase   )   )   )
				    for num in permutations(range(UpperCAmelCase   )   )
				    if is_substring_divisible(UpperCAmelCase   )   )


if __name__ == "__main__":
					print(f'''{solution() = }''')





