





from __future__ import annotations

import math
from itertools import permutations


def 			lowerCamelCase_		(					lowerCAmelCase:		int )->						bool:

  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 			lowerCamelCase_		(					lowerCAmelCase:		int = 7 )->						int:
  _snake_case      : List[str]														=		''.join(str(lowerCAmelCase ) for i in range(1			,							n + 1 ) )
  _snake_case      : Union[str, Any]														=		[int(''.join(lowerCAmelCase ) ) for i in permutations(lowerCAmelCase			,							lowerCAmelCase )]
  _snake_case      : Tuple														=		[num for num in perm_list if is_prime(lowerCAmelCase )]
  return max(lowerCAmelCase ) if pandigitals else 0


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











def 			lowerCamelCase_		(					lowerCAmelCase:		list			,							lowerCAmelCase:		list )->						list:
  _snake_case      : int														=		len(lowerCAmelCase )
  _snake_case      : int														=		len(lowerCAmelCase )
  _snake_case      : int														=		(
      first_input_list_length
      if first_input_list_length > second_input_list_length
      else second_input_list_length
  )
  _snake_case      : list														=		[]
  for char_count in range(lowerCAmelCase ):
    if char_count < first_input_list_length:
      output_result_list.append(first_input_list[char_count] )
    if char_count < second_input_list_length:
      output_result_list.append(second_input_list[char_count] )

  return output_result_list


if __name__ == "__main__":
      print(alternative_list_arrange(["""A""", """B""", """C"""], [1, 2, 3, 4, 5]), end=""" """)




