
'''simple docstring'''






import math







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







def 		A_       (	_lowerCAmelCase   :    float = 0.1							):



      """simple docstring"""




      _lowerCamelCase				:   Union[str, Any]								=   3
      _lowerCamelCase				:   int								=   3

      while primes / (2 * j - 1) >= ratio:
            for i in range(j * j + j + 1				,	(j + 2) * (j + 2)				,	j + 1							):
                  primes += is_prime(_lowerCAmelCase							)
            j += 2
      return j


if __name__ == "__main__":
 import doctest

 doctest.testmod()

'''simple docstring'''






from __future__ import annotations

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

UpperCAmelCase_       :   str   =       (3, 9, -11, 0, 7, 5, 1, -1)
UpperCAmelCase_       :   int   =       (4, 6, 2, 0, 8, 10, 3, -2)

@dataclass
class  UpperCAmelCase__						:
    lowerCAmelCase_				    =		42
    lowerCAmelCase_				    =		42


class  UpperCAmelCase__						:



    def __init__(	self      :       Optional[int],__A      :       Iterable[int]     ):
          _lowerCamelCase				:   Node | None								=   None
          for i in sorted(__A,reverse=__A     ):
                _lowerCamelCase				:   Dict								=   Node(__A,self.head     )



    def __iter__(	self      :       str     ):
          _lowerCamelCase				:   Dict								=   self.head
          while node:
                yield node.data
                _lowerCamelCase				:   Optional[Any]								=   node.next_node



    def __len__(	self      :       str     ):
          return sum(1 for _ in self     )



    def __str__(	self      :       str     ):
          return " -> ".join([str(__A     ) for node in self]     )







def 		A_       (	_lowerCAmelCase   :    SortedLinkedList				,	_lowerCAmelCase   :    SortedLinkedList							):



      """simple docstring"""




      return SortedLinkedList(list(_lowerCAmelCase							) + list(_lowerCAmelCase							)							)


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 UpperCAmelCase_       :   List[str]   =       SortedLinkedList
 print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))