




"""simple docstring"""




def     a__ (				snake_case__       , snake_case__				)						->					str:
			if not isinstance(lowercase_       , lowercase_				):
						raise ValueError("""iterations must be defined as integers"""				)
			if not isinstance(lowercase_       , lowercase_				) 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"""				)

			lowerCamelCase			      =					""""""
			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(lowercase_				)

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


if __name__ == "__main__":
					import doctest

					doctest.testmod()






from math import factorial

def 						UpperCamelCase					(lowercase_: int = 20					)     ->      int:
	A__							:    Union[str, Any]        =		2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
	# 2, 3,...
	A__							:    Tuple        =		n // 2

	return int(factorial(lowercase_					) / (factorial(lowercase_					) * factorial(n - k					))					)


if __name__ == "__main__":
	import sys

	if len(sys.argv) == 1:
		print(solution(20))
	else:
		try:
			A_       : List[str]         =			int(sys.argv[1])
			print(solution(n))
		except ValueError:
			print('Invalid entry - please enter a number.')



