



from math import factorial

def      lowerCAmelCase_					(  _lowercase    :       int = 20)							->	int:
			a__       :						str							=  2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
			# 2, 3,...
			a__       :						List[str]							=  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:
						_lowercase		:				Any      		=int(sys.argv[1])
						print(solution(n))
				except ValueError:
						print("Invalid entry - please enter a number.")









from __future__ import annotations

import math

def      lowerCAmelCase_					(  _lowercase    :       int)							->	list[int]:







			"""simple docstring"""

			if num <= 0:
						a__       :						Tuple							=  F'''{num}: Invalid input, please enter a positive integer.'''
						raise ValueError(_lowercase)

			a__       :						List[Any]							=  [True] * (num + 1)
			a__       :						List[str]							=  []
			a__       :						List[Any]							=  2
			a__       :						Optional[int]							=  int(math.sqrt(_lowercase))

			while start <= end:
						# If start is a prime
						if sieve[start] is True:
									prime.append(_lowercase)

									# Set multiples of start be False
									for i in range(start * start						,       num + 1						,       _lowercase):
												if sieve[i] is True:
															a__       :						Optional[int]							=  False

						start += 1

			for j in range(end + 1						,       num + 1):
						if sieve[j] is True:
									prime.append(_lowercase)

			return prime


if __name__ == "__main__":
		print(prime_sieve(int(input("Enter a positive integer: ").strip())))




