

def    __lowerCamelCase      (					UpperCamelCase__ ):







							'''simple docstring'''






							snake_case_     							=       [1]

							snake_case_							,       snake_case_							,       snake_case_     							=       0, 0, 0
							snake_case_     							=       ugly_nums[ia] * 2
							snake_case_     							=       ugly_nums[ia] * 3
							snake_case_     							=       ugly_nums[ia] * 5

							for _ in range(1  ,				UpperCamelCase__ ):
														snake_case_     							=       min(UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__ )
														ugly_nums.append(UpperCamelCase__ )
														if next_num == next_a:
																					ia += 1
																					snake_case_     							=       ugly_nums[ia] * 2
														if next_num == next_a:
																					ia += 1
																					snake_case_     							=       ugly_nums[ia] * 3
														if next_num == next_a:
																					ia += 1
																					snake_case_     							=       ugly_nums[ia] * 5
							return ugly_nums[-1]


if __name__ == "__main__":
					from doctest import testmod

					testmod(verbose=True)
					print(F'''{ugly_numbers(200) = }''')







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() = }''')




