






'''simple docstring'''







from __future__ import annotations

from typing import Any
def 						A__			(				__lowerCAmelCase		:			list						):
						if not postfix_notation:
												return 0

						lowerCamelCase__         =  {"""+""", """-""", """*""", """/"""}
						lowerCamelCase__         =  []

						for token in postfix_notation:
												if token in operations:
																		lowerCamelCase__       ,			lowerCamelCase__         =  stack.pop(), stack.pop()
																		if token == "+":
																								stack.append(a + b						)
																		elif token == "-":
																								stack.append(a - b						)
																		elif token == "*":
																								stack.append(a * b						)
																		else:
																								if a * b < 0 and a % b != 0:
																														stack.append(a // b + 1						)
																								else:
																														stack.append(a // b						)
												else:
																		stack.append(int(__lowerCAmelCase						)						)

						return stack.pop()


if __name__ == "__main__":
							import doctest

							doctest.testmod()









'''simple docstring'''







from __future__ import annotations

import math
def 						A__			(				__lowerCAmelCase		:			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(__lowerCAmelCase						) + 1						)   ,    6						):
												if number % i == 0 or number % (i + 2) == 0:
																		return False
						return True


UpperCamelCase    :      str  			=		[num for num in range(3, 10_00_01, 2) if not is_prime(num)]
def 						A__			(				__lowerCAmelCase		:			int						):
						if not isinstance(__lowerCAmelCase   ,    __lowerCAmelCase						):
												raise ValueError("""n must be an integer"""						)
						if n <= 0:
												raise ValueError("""n must be >= 0"""						)

						lowerCamelCase__         =  []
						for num in range(len(__lowerCAmelCase						)						):
												lowerCamelCase__         =  0
												while 2 * i * i <= odd_composites[num]:
																		lowerCamelCase__         =  odd_composites[num] - 2 * i * i
																		if is_prime(__lowerCAmelCase						):
																								break
																		i += 1
												else:
																		list_nums.append(odd_composites[num]						)
																		if len(__lowerCAmelCase						) == n:
																								return list_nums

						return []
def 						A__			(				):
						return compute_nums(1						)[0]


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

