




'''simple docstring'''



from __future__ import annotations

import math
from itertools import permutations







def      _UpperCamelCase	(_lowerCamelCase							:       int		)->				bool:




     '''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(_lowerCamelCase		) + 1		)				,		6		):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True







def      _UpperCamelCase	(_lowerCamelCase							:       int = 7		)->				int:




     '''simple docstring'''





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


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












'''simple docstring'''



def      _UpperCamelCase	(_lowerCamelCase							:       list				,		_lowerCamelCase							:       int		)->				int:




     '''simple docstring'''





     for index, item in enumerate(_lowerCamelCase		):
          if item == target:
               return index
     return -1







def      _UpperCamelCase	(_lowerCamelCase							:       list				,		_lowerCamelCase							:       int				,		_lowerCamelCase							:       int				,		_lowerCamelCase							:       int		)->				int:




     '''simple docstring'''





     if not (0 <= high < len(_lowerCamelCase		) and 0 <= low < len(_lowerCamelCase		)):
          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(_lowerCamelCase				,		low + 1				,		high - 1				,		_lowerCamelCase		)


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

     UpperCAmelCase_    :					List[str]					      =						int(input('''Enter a single number to be found in the list:\n''').strip())
     UpperCAmelCase_    :					Optional[int]					      =						linear_search(sequence, target)
     if result != -1:
          print(F"""linear_search({sequence}, {target}) = {result}""")
     else:
          print(F"""{target} was not found in {sequence}""")






