



'''simple docstring'''


from __future__ import annotations

_lowerCamelCase	:       str      	=	[True] * 100_0001
_lowerCamelCase	:       str      	=	2
while i * i <= 100_0000:
   if seive[i]:
      for j in range(i * i, 100_0001, i):
         _lowerCamelCase	:       Optional[int]      	=	False
   i += 1







def 				__lowerCamelCase				(   A__    )       ->	bool:






   """simple docstring"""
   return seive[n]







def 				__lowerCamelCase				(   A__    )       ->	bool:






   """simple docstring"""
   return any(digit in '02468' for digit in str(A__    )    )







def 				__lowerCamelCase				(   A__ = 1_000_000    )       ->	list[int]:






   """simple docstring"""
   UpperCamelCase					=  [2]  # result already includes the number 2.
   for num in range(3    ,						limit + 1    ,						2    ):
      if is_prime(A__    ) and not contains_an_even_digit(A__    ):
         UpperCamelCase					=  str(A__    )
         UpperCamelCase					=  [int(str_num[j:] + str_num[:j]    ) for j in range(len(A__    )    )]
         if all(is_prime(A__    ) for i in list_nums    ):
            result.append(A__    )
   return result







def 				__lowerCamelCase				(   )       ->	int:






   """simple docstring"""
   return len(find_circular_primes()    )


if __name__ == "__main__":
   print(f'''{len(find_circular_primes()) = }''')






'''simple docstring'''


def 				__lowerCamelCase				(   A__ = 10**9    )       ->	int:






   """simple docstring"""
   UpperCamelCase					=  1
   UpperCamelCase					=  2

   UpperCamelCase					=  0
   UpperCamelCase					=  0
   UpperCamelCase					=  0
   while perimeter <= max_perimeter:
      perimeters_sum += perimeter

      prev_value += 2 * value
      value += prev_value

      UpperCamelCase					=  2 * value + 2 if i % 2 == 0 else 2 * value - 2
      i += 1

   return perimeters_sum


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

