




def 				_A  (		lowerCAmelCase_	:   Optional[int]  ,							lowerCAmelCase_	:   List[str]  ,							lowerCAmelCase_	:   Tuple  ,							lowerCAmelCase_	:   List[Any]  ,							lowerCAmelCase_	:   str  ,							lowerCAmelCase_	:   List[str]     ):
     """simple docstring"""

     if index == r:
          for j in range(lowerCAmelCase_     ):
               print(data[j]  ,							end=" "     )
          print(" "     )
          return
     #  When no more elements are there to put in data[]
     if i >= n:
          return
     # current is included, put next at next location
     lowerCAmelCase__            =					arr[i]
     combination_util(lowerCAmelCase_  ,							lowerCAmelCase_  ,							lowerCAmelCase_  ,							index + 1  ,							lowerCAmelCase_  ,							i + 1     )
     # current is excluded, replace it with
     # next (Note that i+1 is passed, but
     # index is not changed)
     combination_util(lowerCAmelCase_  ,							lowerCAmelCase_  ,							lowerCAmelCase_  ,							lowerCAmelCase_  ,							lowerCAmelCase_  ,							i + 1     )
     # The main function that prints all combinations
     # of size r in arr[] of size n. This function
     # mainly uses combinationUtil()



def 				_A  (		lowerCAmelCase_	:   Optional[Any]  ,							lowerCAmelCase_	:   int  ,							lowerCAmelCase_	:   Tuple     ):
     """simple docstring"""

     lowerCAmelCase__            =					[0] * r
     # Print all combination using temporary array 'data[]'
     combination_util(lowerCAmelCase_  ,							lowerCAmelCase_  ,							lowerCAmelCase_  ,							0  ,							lowerCAmelCase_  ,							0     )


if __name__ == "__main__":
     # Driver code to check the function above
     UpperCamelCase								=	[10, 20, 30, 40, 50]
     print_combination(arr, len(arr), 3)
     # This code is contributed by Ambuj sahu



from math import sqrt





def    __lowerCamelCase      (					UpperCamelCase__ ):







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





def    __lowerCamelCase      (					UpperCamelCase__ = 10001 ):







							'''simple docstring'''






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


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




