






from __future__ import annotations

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

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


@dataclass
class        __UpperCamelCase    :
	__snake_case	:int
	__snake_case	:Node | None


class        __UpperCamelCase    :







	def __init__(  self      :							Union[str, Any]       ,				_lowerCAmelCase      :							Iterable[int]			)		-> None:
		"""simple docstring"""







		__lowercase             =  None
		for i in sorted(_lowerCAmelCase       ,				reverse=_lowerCAmelCase			):
			__lowercase             =  Node(_lowerCAmelCase       ,				self.head			)







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







		__lowercase             =  self.head
		while node:
			yield node.data
			__lowercase             =  node.next_node







	def __len__(  self      :							Dict			)		-> int:
		"""simple docstring"""







		return sum(1 for _ in self			)







	def __str__(  self      :							int			)		-> str:
		"""simple docstring"""







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





def 				snake_case  (     lowerCamelCase				,  lowerCamelCase					):




	'''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)))









from math import sqrt





def 				snake_case  (     lowerCamelCase					):




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





def 				snake_case  (     lowerCamelCase = 10_001					):




	'''simple docstring'''







	__lowercase             =  0
	__lowercase             =  1
	while count != nth and number < 3:
		number += 1
		if is_prime(lowerCamelCase					):
			count += 1
	while count != nth:
		number += 2
		if is_prime(lowerCamelCase					):
			count += 1
	return number


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

