
from __future__ import annotations

import math


def     __lowerCAmelCase			(			a__  )       ->  list[int]:

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

				__a										=    [True] * (num + 1)
				__a										=    []
				__a										=    2
				__a										=    int(math.sqrt(a__  )  )

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

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

								start += 1

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

				return prime


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

from __future__ import annotations

import typing
from collections import Counter


def     __lowerCAmelCase			(			a__  )       ->  typing.Counter[int]:
				__a										=    Counter()
				for base in range(1						,    max_perimeter + 1  ):
								for perpendicular in range(a__						,    max_perimeter + 1  ):
												__a										=    (base * base + perpendicular * perpendicular) ** 0.5
												if hypotenuse == int(a__  ):
																__a										=    int(base + perpendicular + hypotenuse  )
																if perimeter > max_perimeter:
																				continue
																triplets[perimeter] += 1
				return triplets


def     __lowerCAmelCase			(			a__ = 1000  )       ->  int:
				__a										=    pythagorean_triple(a__  )
				return triplets.most_common(1  )[0][0]


if __name__ == "__main__":
					print(F"Perimeter {solution()} has maximum solutions")