def SCREAMING_SNAKE_CASE					(  lowercase_:						list		,    lowercase_:						int					):
       for index, item in enumerate(lowercase_					):
              if item == target:
                     return index
       return -1


def SCREAMING_SNAKE_CASE					(  lowercase_:						list		,    lowercase_:						int		,    lowercase_:						int		,    lowercase_:						int					):
       if not (0 <= high < len(lowercase_					) and 0 <= low < len(lowercase_					)):
              raise Exception('Invalid upper or lower bound!'					)
       if high < low:
              return -1
       if sequence[low] == target:
              return low
       if sequence[high] == target:
              return high
       return rec_linear_search(lowercase_		,    low + 1		,    high - 1		,    lowercase_					)


if __name__ == "__main__":
 UpperCAmelCase      		=					input('''Enter numbers separated by comma:\n''').strip()
 UpperCAmelCase      		=					[int(item.strip()) for item in user_input.split(''',''')]

 UpperCAmelCase      		=					int(input('''Enter a single number to be found in the list:\n''').strip())
 UpperCAmelCase      		=					linear_search(sequence, target)
 if result != -1:
  print(f'''linear_search({sequence}, {target}) = {result}''')
 else:
  print(f'''{target} was not found in {sequence}''')







from __future__ import annotations

import math
from itertools import permutations

def 		snake_case_   (				lowercase__     :    int     ):






				'''simple docstring'''






				if 1 < number < 4:
								# 2 and 3 are primes
								return True
				elif number < 2 or number % 2 == 0 or number % 3 == 0:
								# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
								return False

				# All primes number are in format of 6k +/- 1
				for i in range(5       ,     int(math.sqrt(lowercase__     ) + 1     )       ,     6     ):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True

def 		snake_case_   (				lowercase__     :    int = 7     ):






				'''simple docstring'''






				_lowerCAmelCase  						="""""".join(str(lowercase__     ) for i in range(1       ,     n + 1     )     )
				_lowerCAmelCase  						=[int("""""".join(lowercase__     )     ) for i in permutations(lowercase__       ,     lowercase__     )]
				_lowerCAmelCase  						=[num for num in perm_list if is_prime(lowercase__     )]
				return max(lowercase__     ) if pandigitals else 0


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

