


'''simple docstring'''






from __future__ import annotations

import math







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







def 				UpperCamelCase_			(    A__					:   int					):
  '''simple docstring'''





  lowerCAmelCase_			:      List[str]			=   str(A__					)
  lowerCAmelCase_			:      Union[str, Any]			=   [n]
  for i in range(1							,    len(A__					)					):
    list_nums.append(int(str_num[i:]					)					)
    list_nums.append(int(str_num[:-i]					)					)
  return list_nums







def 				UpperCamelCase_			(    A__					:   int					):
  '''simple docstring'''





  if len(str(A__					)					) > 3:
    if not is_prime(int(str(A__					)[-3:]					)					) or not is_prime(int(str(A__					)[:3]					)					):
      return False
  return True







def 				UpperCamelCase_			(    A__					:   int = 11					):
  '''simple docstring'''





  lowerCAmelCase_			:      list[int]			=   []
  lowerCAmelCase_			:      Union[str, Any]			=   13
  while len(A__					) != count:
    if validate(A__					):
      lowerCAmelCase_			:      Union[str, Any]			=   list_truncated_nums(A__					)
      if all(is_prime(A__					) for i in list_nums					):
        list_truncated_primes.append(A__					)
    num += 2
  return list_truncated_primes







def 				UpperCamelCase_			(    ):
  '''simple docstring'''





  return sum(compute_truncated_primes(11					)					)


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







'''simple docstring'''






def 				UpperCamelCase_			(    A__					:   int					):
  '''simple docstring'''





  lowerCAmelCase_			:      Union[str, Any]			=   (1 + 24 * n) ** 0.5
  return ((1 + root) / 6) % 1 == 0







def 				UpperCamelCase_			(    A__					:   int = 50_00					):
  '''simple docstring'''





  lowerCAmelCase_			:      Optional[int]			=   [(i * (3 * i - 1)) // 2 for i in range(1							,    A__					)]
  for i, pentagonal_i in enumerate(A__					):
    for j in range(A__							,    len(A__					)					):
      lowerCAmelCase_			:      int			=   pentagonal_nums[j]
      lowerCAmelCase_			:      Union[str, Any]			=   pentagonal_i + pentagonal_j
      lowerCAmelCase_			:      List[Any]			=   pentagonal_j - pentagonal_i
      if is_pentagonal(A__					) and is_pentagonal(A__					):
        return b

  return -1


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



