


"""simple docstring"""



from __future__ import annotations

from collections.abc import Iterable, Iterator
from dataclasses import dataclass

__snake_case       =       (3, 9, -11, 0, 7, 5, 1, -1)
__snake_case       =       (4, 6, 2, 0, 8, 10, 3, -2)







@dataclass
class _lowerCAmelCase							:
   __UpperCAmelCase					:			int
   __UpperCAmelCase					:			Node | None







class _lowerCAmelCase							:







   def __init__(      self		,      UpperCamelCase__		)      ->						None:

       '''simple docstring'''




       snake_case       : Node | None    =       None
       for i in sorted(UpperCamelCase__		,      reverse=UpperCamelCase__		):
           snake_case       : Union[str, Any]    =       Node(UpperCamelCase__		,      self.head		)







   def __iter__(      self		)      ->						Iterator[int]:

       '''simple docstring'''




       snake_case       : Optional[int]    =       self.head
       while node:
           yield node.data
           snake_case       : Union[str, Any]    =       node.next_node







   def __len__(      self		)      ->						int:

       '''simple docstring'''




       return sum(1 for _ in self		)







   def __str__(      self		)      ->						str:

       '''simple docstring'''




       return " -> ".join([str(UpperCamelCase__		) for node in self]		)







def     __lowerCAmelCase		(		lowercase    :    SortedLinkedList		,				lowercase    :    SortedLinkedList					)      ->		SortedLinkedList:


    """simple docstring"""





    return SortedLinkedList(list(lowercase					) + list(lowercase					)					)


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  __snake_case       =       SortedLinkedList
  print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))









"""simple docstring"""



import math
from collections.abc import Iterator
from itertools import takewhile







def     __lowerCAmelCase		(		lowercase    :    int					)      ->		bool:


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







def     __lowerCAmelCase		(		)      ->		Iterator[int]:


    """simple docstring"""





    snake_case       : Optional[int]    =       2
    while True:
        if is_prime(lowercase					):
            yield num
        num += 1







def     __lowerCAmelCase		(		lowercase    :    int = 200_0000					)      ->		int:


    """simple docstring"""





    return sum(takewhile(lambda lowercase					: x < n		,				prime_generator()					)					)


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





