



'''simple docstring'''





from __future__ import annotations

import typing
from collections.abc import Iterable

import numpy as np

lowercase_	 =						typing.Union[Iterable[float], Iterable[int], np.ndarray]  # noqa: UP007
lowercase_	 =						typing.Union[np.floataa, int, float]  # noqa: UP007




def lowerCAmelCase						(__A						,			__A):



					"""simple docstring"""



					return np.sqrt(np.sum((np.asarray(__UpperCAmelCase) - np.asarray(__UpperCAmelCase)) ** 2))




def lowerCAmelCase						(__A						,			__A):



					"""simple docstring"""



					return sum((va - va) ** 2 for va, va in zip(__UpperCAmelCase						,			__UpperCAmelCase)) ** (1 / 2)


if __name__ == "__main__":




		def lowerCAmelCase						():



							"""simple docstring"""



							from timeit import timeit

							print('''Without Numpy''')
							print(
							    timeit(
							        '''euclidean_distance_no_np([1, 2, 3], [4, 5, 6])'''						,			number=10_000						,			globals=globals()						,			))
							print('''With Numpy''')
							print(
							    timeit(
							        '''euclidean_distance([1, 2, 3], [4, 5, 6])'''						,			number=10_000						,			globals=globals()						,			))
		benchmark()








'''simple docstring'''





from __future__ import annotations

lowercase_	 =						[True] * 1_000_001
lowercase_	 =						2
while i * i <= 1_000_000:
  if seive[i]:
    for j in range(i * i, 1_000_001, i):
      lowercase_	 =						False
  i += 1




def lowerCAmelCase						(__A):



     """simple docstring"""



     return seive[n]




def lowerCAmelCase						(__A):



     """simple docstring"""



     return any(digit in '''02468''' for digit in str(__A))




def lowerCAmelCase						(__A = 1_000_000):



     """simple docstring"""



     _a											=						[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):
               _a											=						str(__A)
               _a											=						[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						():



     """simple docstring"""



     return len(find_circular_primes())


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



