





from __future__ import annotations

import math






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






def 	_SCREAMING_SNAKE_CASE		(      SCREAMING_SNAKE_CASE		:int   )      ->   list[int]:
 __lowerCAmelCase					:	int      =       str(SCREAMING_SNAKE_CASE   )
 __lowerCAmelCase					:	Any      =       [n]
 for i in range(1   ,   len(SCREAMING_SNAKE_CASE   )   ):
  list_nums.append(int(str_num[i:]   )   )
  list_nums.append(int(str_num[:-i]   )   )
 return list_nums






def 	_SCREAMING_SNAKE_CASE		(      SCREAMING_SNAKE_CASE		:int   )      ->   bool:
 if len(str(SCREAMING_SNAKE_CASE   )   ) > 3:
  if not is_prime(int(str(SCREAMING_SNAKE_CASE   )[-3:]   )   ) or not is_prime(int(str(SCREAMING_SNAKE_CASE   )[:3]   )   ):
   return False
 return True






def 	_SCREAMING_SNAKE_CASE		(      SCREAMING_SNAKE_CASE		:int = 11   )      ->   list[int]:
 __lowerCAmelCase					:	list[int]      =       []
 __lowerCAmelCase					:	List[str]      =       13
 while len(SCREAMING_SNAKE_CASE   ) != count:
  if validate(SCREAMING_SNAKE_CASE   ):
   __lowerCAmelCase					:	List[str]      =       list_truncated_nums(SCREAMING_SNAKE_CASE   )
   if all(is_prime(SCREAMING_SNAKE_CASE   ) for i in list_nums   ):
    list_truncated_primes.append(SCREAMING_SNAKE_CASE   )
  num += 2
 return list_truncated_primes






def 	_SCREAMING_SNAKE_CASE		(      )      ->   int:
 return sum(compute_truncated_primes(11   )   )


if __name__ == "__main__":
      print(f'''{sum(compute_truncated_primes(11)) = }''')






def 	_SCREAMING_SNAKE_CASE		(      SCREAMING_SNAKE_CASE		:list[int]   )      ->   int:
 if not numbers:
  return 0

 if not isinstance(SCREAMING_SNAKE_CASE   ,   (list, tuple)   ) or not all(
     isinstance(SCREAMING_SNAKE_CASE   ,   SCREAMING_SNAKE_CASE   ) for number in numbers   ):
  raise ValueError("""numbers must be an iterable of integers"""   )

 __lowerCAmelCase					:	int      =       numbers[0]

 for i in range(1   ,   len(SCREAMING_SNAKE_CASE   )   ):
  # update the maximum and minimum subarray products
  __lowerCAmelCase					:	List[str]      =       numbers[i]
  if number < 0:
   __lowerCAmelCase ,					__lowerCAmelCase					:	Union[str, Any]      =       min_till_now, max_till_now
  __lowerCAmelCase					:	Optional[int]      =       max(SCREAMING_SNAKE_CASE   ,   max_till_now * number   )
  __lowerCAmelCase					:	List[Any]      =       min(SCREAMING_SNAKE_CASE   ,   min_till_now * number   )

  # update the maximum product found till now
  __lowerCAmelCase					:	List[str]      =       max(SCREAMING_SNAKE_CASE   ,   SCREAMING_SNAKE_CASE   )

 return max_prod