





'''simple docstring'''






from __future__ import annotations

import typing
from collections import Counter






def      __A						(							a_						:  int	):
		lowerCAmelCase     :    typing.Counter[int]						=   Counter()
		for base in range(1      ,max_perimeter + 1	):
				for perpendicular in range(a_      ,max_perimeter + 1	):
						lowerCAmelCase     :    str						=   (base * base + perpendicular * perpendicular) ** 0.5
						if hypotenuse == int(a_	):
								lowerCAmelCase     :    List[str]						=   int(base + perpendicular + hypotenuse	)
								if perimeter > max_perimeter:
										continue
								triplets[perimeter] += 1
		return triplets






def      __A						(							a_						:  int = 1_0_0_0	):
		lowerCAmelCase     :    Optional[Any]						=   pythagorean_triple(a_	)
		return triplets.most_common(1	)[0][0]


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










'''simple docstring'''






import numpy as np






def      __A						(							a_						:  np.array	):
		return (2 / (1 + np.exp(-2 * vector	))) - 1


if __name__ == "__main__":
					import doctest

					doctest.testmod()



