


def   _lowerCAmelCase				(   UpperCamelCase__:     int							,					UpperCamelCase__:     list[int]							,					UpperCamelCase__:     int						) ->   int:





	"""simple docstring"""







	def count_of_possible_combinations(UpperCamelCase__:     int						) -> int:
		if target < 0:
			return 0
		if target == 0:
			return 1
		return sum(count_of_possible_combinations(target - item						) for item in array						)

	return count_of_possible_combinations(UpperCamelCase__						)





def   _lowerCAmelCase				(   UpperCamelCase__:     int							,					UpperCamelCase__:     list[int]							,					UpperCamelCase__:     int						) ->   int:





	"""simple docstring"""







	def count_of_possible_combinations_with_dp_array(
	    UpperCamelCase__:     int							,					UpperCamelCase__:     list[int]						) -> int:
		if target < 0:
			return 0
		if target == 0:
			return 1
		if dp_array[target] != -1:
			return dp_array[target]
		A								=				sum(
		    count_of_possible_combinations_with_dp_array(target - item							,					UpperCamelCase__						)
		    for item in array						)
		A								=				answer
		return answer

	A								=				[-1] * (target + 1)
	return count_of_possible_combinations_with_dp_array(UpperCamelCase__							,					UpperCamelCase__						)





def   _lowerCAmelCase				(   UpperCamelCase__:     int							,					UpperCamelCase__:     list[int]							,					UpperCamelCase__:     int						) ->   int:





	"""simple docstring"""







	A								=				[0] * (target + 1)
	A								=				1

	for i in range(1							,					target + 1						):
		for j in range(UpperCamelCase__						):
			if i - array[j] >= 0:
				dp_array[i] += dp_array[i - array[j]]

	return dp_array[target]


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				_lowercase       :      str	=	3
				_lowercase       :      Optional[Any]	=	5
				_lowercase       :      Union[str, Any]	=	[1, 2, 5]
				print(combination_sum_iv(n, array, target))







def   _lowerCAmelCase				(   UpperCamelCase__:     int						) ->   list[int]:





	"""simple docstring"""







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

	A								=				[True] * (num + 1)

	A								=				2
	while p * p <= num:
		if primes[p]:
			for i in range(p * p							,					num + 1							,					UpperCamelCase__						):
				A								=				False
		p += 1

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


if __name__ == "__main__":
				import doctest

				doctest.testmod()

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



