"""simple docstring"""





import itertools
import math



def   lowerCamelCase_(__SCREAMING_SNAKE_CASE	)->     bool:

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



def   lowerCamelCase_()->     Tuple:
							_SCREAMING_SNAKE_CASE		:    Union[str, Any]      	=     2
							while True:
														if is_prime(UpperCamelCase__	):
																					yield num
														num += 1



def   lowerCamelCase_(__SCREAMING_SNAKE_CASE = 10_001	)->     int:
							return next(itertools.islice(prime_generator()  ,						nth - 1  ,						UpperCamelCase__	)	)


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









class        SCREAMING_SNAKE_CASE__					:



 def __init__(				self,__lowerCamelCase					):
        A__		   =		size
        A__		   =		[0] * size
        A__		   =		[0] * size



 @staticmethod
 def 							UpperCamelCase     (				__lowerCamelCase					):
        return index | (index + 1)



 @staticmethod
 def 							UpperCamelCase     (				__lowerCamelCase					):
        return (index & (index + 1)) - 1



 def 							UpperCamelCase     (				self,__lowerCamelCase,__lowerCamelCase					):
        A__		   =		value
        while index < self.size:
               A__		   =		self.get_prev(__lowerCamelCase					) + 1
               if current_left_border == index:
                      A__		   =		value
               else:
                      A__		   =		max(__lowerCamelCase,__lowerCamelCase,__lowerCamelCase					)
               A__		   =		self.get_next(__lowerCamelCase					)




 def 							UpperCamelCase     (				self,__lowerCamelCase,__lowerCamelCase					):
        right -= 1  # Because of right is exclusive
        A__		   =		0
        while left <= right:
               A__		   =		self.get_prev(__lowerCamelCase					)
               if left <= current_left:
                      A__		   =		max(__lowerCamelCase,self.tree[right]					)
                      A__		   =		current_left
               else:
                      A__		   =		max(__lowerCamelCase,self.arr[right]					)
                      right -= 1
        return result


if __name__ == "__main__":
       import doctest

       doctest.testmod()





