


from __future__ import annotations

import math




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




def       a_ (       SCREAMING_SNAKE_CASE__   : int	):
       '''simple docstring'''





       _lowerCamelCase			:						Optional[Any]            =str(SCREAMING_SNAKE_CASE__	)
       _lowerCamelCase			:						Tuple            =[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       a_ (       SCREAMING_SNAKE_CASE__   : Any	):
       '''simple docstring'''





       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       a_ (       SCREAMING_SNAKE_CASE__   : Optional[int] = 11	):
       '''simple docstring'''





       _lowerCamelCase			:						Union[str, Any]            =[]
       _lowerCamelCase			:						Tuple            =13
       while len(SCREAMING_SNAKE_CASE__	) != count:
              if validate(SCREAMING_SNAKE_CASE__	):
                     _lowerCamelCase			:						Union[str, Any]            =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       a_ (       ):
       '''simple docstring'''





       return sum(compute_truncated_primes(11	)	)


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



def _lowerCamelCase  (		snake_case  ):
							assert (
							    isinstance(snake_case     , snake_case  ) and number_of_steps > 0
							), F'number_of_steps needs to be positive integer, your input {number_of_steps}'
							if number_of_steps == 1:
														return 1
							_lowerCAmelCase			,		_lowerCAmelCase							=							1, 1
							for _ in range(number_of_steps - 1  ):
														_lowerCAmelCase			,		_lowerCAmelCase							=							current + previous, current
							return current


if __name__ == "__main__":
				import doctest

				doctest.testmod()






