






"""simple docstring"""





from __future__ import annotations

import math







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 )      ->				list[int]:
  lowerCamelCase_         =						str(_lowerCamelCase )
  lowerCamelCase_         =						[n]
  for i in range(1		,				len(_lowerCamelCase ) ):
    list_nums.append(int(str_num[i:] ) )
    list_nums.append(int(str_num[:-i] ) )
  return list_nums







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







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







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


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












"""simple docstring"""





from __future__ import annotations

import math







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 )      ->				list[int]:
  lowerCamelCase_         =						str(_lowerCamelCase )
  lowerCamelCase_         =						[n]
  for i in range(1		,				len(_lowerCamelCase ) ):
    list_nums.append(int(str_num[i:] ) )
    list_nums.append(int(str_num[:-i] ) )
  return list_nums







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







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







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


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




