
"""simple docstring"""




from __future__ import annotations

import math

def lowercase_  (   _snake_case						):

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

def lowercase_  (   _snake_case						):
							SCREAMING_SNAKE_CASE__						:       str           =   str(_snake_case						)
							SCREAMING_SNAKE_CASE__						:       Any           =   [n]
							for i in range(1   ,len(_snake_case						)						):
														list_nums.append(int(str_num[i:]						)						)
														list_nums.append(int(str_num[:-i]						)						)
							return list_nums

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

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

def lowercase_  (   ):
							return sum(compute_truncated_primes(11						)						)


if __name__ == "__main__":
					print(f"""{sum(compute_truncated_primes(1_1)) = }""")






import itertools
import math




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




def 				a						(							):


				'''simple docstring'''
				lowercase_       =					2
				while True:
								if is_prime(snake_case__					):
												yield num
								num += 1




def 				a						(							snake_case__:					int = 10_001					):


				'''simple docstring'''
				return next(itertools.islice(prime_generator()						,   nth - 1						,   snake_case__					)					)


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




