
'''simple docstring'''


from __future__ import annotations

import math




def lowercase_	(   _lowercase				)     ->							list[int]:
					'''simple docstring'''

					if num <= 0:
										lowerCamelCase_					:      List[Any]     =		F"""{num}: Invalid input, please enter a positive integer."""
										raise ValueError(_lowercase				)

					lowerCamelCase_					:      Dict     =		[True] * (num + 1)
					lowerCamelCase_					:      Dict     =		[]
					lowerCamelCase_					:      Optional[Any]     =		2
					lowerCamelCase_					:      Dict     =		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:
																									lowerCamelCase_					:      Optional[Any]     =		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())))




'''simple docstring'''


def lowercase_	(   _lowercase = 1_000				)     ->							int:
					'''simple docstring'''

					lowerCamelCase_					:      Any     =		-1
					lowerCamelCase_					:      Optional[Any]     =		0
					for a in range(1			,       n // 3				):
										# Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
										lowerCamelCase_					:      Any     =		(n * n - 2 * a * n) // (2 * n - 2 * a)
										lowerCamelCase_					:      int     =		n - a - b
										if c * c == (a * a + b * b):
															lowerCamelCase_					:      int     =		a * b * c
															if candidate >= product:
																				lowerCamelCase_					:      Any     =		candidate
					return product


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


