
"""simple docstring"""






def __A						(   a_ :							int = 1		,		a_ :							int = 10_00     )->							int:




		'''simple docstring'''






		SCREAMING_SNAKE_CASE       :     List[Any]				= 1
		SCREAMING_SNAKE_CASE       :     List[str]				= 0

		for divide_by_number in range(a_		,		digit + 1     ):
				SCREAMING_SNAKE_CASE       :     list[int]				= []
				SCREAMING_SNAKE_CASE       :     str				= numerator
				for _ in range(1		,		digit + 1     ):
						if now_divide in has_been_divided:
								if longest_list_length < len(a_     ):
										SCREAMING_SNAKE_CASE       :     int				= len(a_     )
										SCREAMING_SNAKE_CASE       :     Union[str, Any]				= divide_by_number
						else:
								has_been_divided.append(a_     )
								SCREAMING_SNAKE_CASE       :     List[str]				= now_divide * 10 % divide_by_number

		return the_digit


# Tests
if __name__ == "__main__":
					import doctest

					doctest.testmod()







"""simple docstring"""






def __A						(   a_ :							int     )->							list[int]:




		'''simple docstring'''






		if num <= 0:
				raise ValueError('''Input must be a positive integer'''     )

		SCREAMING_SNAKE_CASE       :     Optional[int]				= [True] * (num + 1)

		SCREAMING_SNAKE_CASE       :     Optional[Any]				= 2
		while p * p <= num:
				if primes[p]:
						for i in range(p * p		,		num + 1		,		a_     ):
								SCREAMING_SNAKE_CASE       :     Any				= False
				p += 1

		return [prime for prime in range(2		,		num + 1     ) if primes[prime]]


if __name__ == "__main__":
					import doctest

					doctest.testmod()

					lowerCamelCase__ :       str						     =			int(input("Enter a positive integer: ").strip())
					print(prime_sieve_eratosthenes(user_num))





