





'''simple docstring'''



from __future__ import annotations

import typing
from collections import Counter




def 				_lowerCAmelCase  (			lowerCamelCase_     :					int			):
			__lowercase			  =							Counter()
			for base in range(1						,    max_perimeter + 1			):
						for perpendicular in range(lowerCamelCase_						,    max_perimeter + 1			):
									__lowercase			  =							(base * base + perpendicular * perpendicular) ** 0.5
									if hypotenuse == int(lowerCamelCase_			):
												__lowercase			  =							int(base + perpendicular + hypotenuse			)
												if perimeter > max_perimeter:
															continue
												triplets[perimeter] += 1
			return triplets




def 				_lowerCAmelCase  (			lowerCamelCase_     :					int = 1_0_0_0			):
			__lowercase			  =							pythagorean_triple(lowerCamelCase_			)
			return triplets.most_common(1			)[0][0]


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












'''simple docstring'''



def 				_lowerCAmelCase  (			lowerCamelCase_     :					Union[str, Any]			):
			__lowercase			  =							1
			__lowercase			  =							2
			while i * i <= n:
						__lowercase			  =							0
						while n % i == 0:
									n //= i
									multiplicity += 1
						n_divisors *= multiplicity + 1
						i += 1
			if n > 1:
						n_divisors *= 2
			return n_divisors




def 				_lowerCAmelCase  (			):
			__lowercase			  =							1
			__lowercase			  =							1

			while True:
						i += 1
						t_num += i

						if count_divisors(lowerCamelCase_			) > 5_0_0:
									break

			return t_num


if __name__ == "__main__":
	print(solution())





