


'''simple docstring'''

import itertools
import math





def __snake_case					(      UpperCAmelCase_						:						int		):

 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 __snake_case					(      ):
 lowerCamelCase_      =  2
 while True:
  if is_prime(UpperCAmelCase_		):
   yield num
  num += 1





def __snake_case					(      UpperCAmelCase_						:						int = 10001		):
 return next(itertools.islice(prime_generator()					,				nth - 1					,				UpperCAmelCase_		)		)


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









def 		__A		(	__lowerCamelCase							,			__lowerCamelCase    )      ->       str:
	if not isinstance(__lowerCamelCase							,			__lowerCamelCase    ):
		raise ValueError("""iterations must be defined as integers"""    )
	if not isinstance(__lowerCamelCase							,			__lowerCamelCase    ) or not number >= 1:
		raise ValueError(
		    """starting number must be
                         and integer and be more than 0"""    )
	if not iterations >= 1:
		raise ValueError("""Iterations must be done more than 0 times to play FizzBuzz"""    )

	a										=							""""""
	while number <= iterations:
		if number % 3 == 0:
			out += "Fizz"
		if number % 5 == 0:
			out += "Buzz"
		if 0 not in (number % 3, number % 5):
			out += str(__lowerCamelCase    )

		# print(out)
		number += 1
		out += " "
	return out


if __name__ == "__main__":
		import doctest

		doctest.testmod()

